Wikibooks edits (nds)

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


Internal nameedit-ndswikibooks
NameWikibooks edits (nds)
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 =244
Left size n1 =52
Right size n2 =192
Volume m =286
Unique edge count m̿ =216
Wedge count s =3,187
Claw count z =71,037
Cross count x =1,284,242
Square count q =26
4-Tour count T4 =13,432
Maximum degree dmax =79
Maximum left degree d1max =79
Maximum right degree d2max =42
Average degree d =2.344 26
Average left degree d1 =5.500 00
Average right degree d2 =1.489 58
Fill p =0.021 634 6
Average edge multiplicity m̃ =1.324 07
Size of LCC N =94
Diameter δ =7
50-Percentile effective diameter δ0.5 =1.634 70
90-Percentile effective diameter δ0.9 =3.494 72
Median distance δM =2
Mean distance δm =2.387 21
Gini coefficient G =0.576 267
Balanced inequality ratio P =0.276 224
Left balanced inequality ratio P1 =0.216 783
Right balanced inequality ratio P2 =0.398 601
Relative edge distribution entropy Her =0.868 702
Power law exponent γ =5.501 83
Tail power law exponent γt =2.721 00
Tail power law exponent with p γ3 =2.721 00
p-value p =0.021 000 0
Left tail power law exponent with p γ3,1 =1.851 00
Left p-value p1 =0.005 000 00
Right tail power law exponent with p γ3,2 =8.111 00
Right p-value p2 =0.867 000
Degree assortativity ρ =−0.234 974
Degree assortativity p-value pρ =0.000 497 230
Spectral norm α =42.201 9
Algebraic connectivity a =0.107 024
Spectral separation 1[A] / λ2[A]| =4.573 77
Controllability C =140
Relative controllability Cr =0.573 770


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.