Wikibooks edits (lv)

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


Internal nameedit-lvwikibooks
NameWikibooks edits (lv)
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 =420
Left size n1 =59
Right size n2 =361
Volume m =774
Unique edge count m̿ =440
Wedge count s =12,954
Claw count z =438,841
Cross count x =13,052,244
Square count q =255
4-Tour count T4 =54,760
Maximum degree dmax =304
Maximum left degree d1max =304
Maximum right degree d2max =50
Average degree d =3.685 71
Average left degree d1 =13.118 6
Average right degree d2 =2.144 04
Fill p =0.020 658 2
Average edge multiplicity m̃ =1.759 09
Size of LCC N =325
Diameter δ =15
50-Percentile effective diameter δ0.5 =3.826 85
90-Percentile effective diameter δ0.9 =9.877 49
Median distance δM =4
Mean distance δm =5.801 80
Gini coefficient G =0.683 055
Balanced inequality ratio P =0.229 328
Left balanced inequality ratio P1 =0.134 367
Right balanced inequality ratio P2 =0.320 413
Relative edge distribution entropy Her =0.821 168
Power law exponent γ =5.160 87
Tail power law exponent γt =2.651 00
Tail power law exponent with p γ3 =2.651 00
p-value p =0.007 000 00
Left tail power law exponent with p γ3,1 =1.741 00
Left p-value p1 =0.090 000 0
Right tail power law exponent with p γ3,2 =4.551 00
Right p-value p2 =0.205 000
Degree assortativity ρ =−0.182 855
Degree assortativity p-value pρ =0.000 114 667
Spectral norm α =61.244 8
Algebraic connectivity a =0.003 678 14
Spectral separation 1[A] / λ2[A]| =1.417 80
Controllability C =303
Relative controllability Cr =0.723 150


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.