Wikibooks edits (lt)

This is the bipartite edit network of the Lithuanian Wikibooks. It contains users and pages from the Lithuanian Wikibooks, connected by edit events. Each edge represents an edit. The dataset includes the timestamp of each edit.


Internal nameedit-ltwikibooks
NameWikibooks edits (lt)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Authorship network
Dataset timestamp 2017-10-20
Node meaningUser, article
Edge meaningEdit
Network formatBipartite, undirected
Edge typeUnweighted, multiple edges
Temporal data Edges are annotated with timestamps


Size n =3,014
Left size n1 =335
Right size n2 =2,679
Volume m =14,799
Unique edge count m̿ =4,132
Wedge count s =706,173
Claw count z =187,207,532
Cross count x =43,077,676,536
Square count q =26,016
4-Tour count T4 =3,045,748
Maximum degree dmax =5,061
Maximum left degree d1max =5,061
Maximum right degree d2max =608
Average degree d =9.820 17
Average left degree d1 =44.176 1
Average right degree d2 =5.524 08
Fill p =0.004 604 08
Average edge multiplicity m̃ =3.581 56
Size of LCC N =2,703
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.598 37
90-Percentile effective diameter δ0.9 =5.751 10
Median distance δM =4
Mean distance δm =4.242 42
Gini coefficient G =0.855 073
Balanced inequality ratio P =0.134 502
Left balanced inequality ratio P1 =0.090 276 4
Right balanced inequality ratio P2 =0.197 986
Relative edge distribution entropy Her =0.800 848
Power law exponent γ =3.695 07
Tail power law exponent γt =2.571 00
Tail power law exponent with p γ3 =2.571 00
p-value p =0.001 000 00
Left tail power law exponent with p γ3,1 =1.681 00
Left p-value p1 =0.007 000 00
Right tail power law exponent with p γ3,2 =3.971 00
Right p-value p2 =0.794 000
Degree assortativity ρ =−0.180 747
Degree assortativity p-value pρ =1.111 28 × 10−31
Spectral norm α =1,007.33
Algebraic connectivity a =0.017 228 2
Spectral separation 1[A] / λ2[A]| =1.094 58
Controllability C =2,356
Relative controllability Cr =0.793 801


Fruchterman–Reingold graph drawing

Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Degree assortativity

Zipf plot

Hop distribution

Double Laplacian graph drawing

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal distribution

Temporal hop distribution

Diameter/density evolution

Matrix decompositions plots



[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]
[2] Wikimedia Foundation. Wikimedia downloads., January 2010.