Wikibooks edits (als)

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


Internal nameedit-alswikibooks
NameWikibooks edits (als)
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 =270
Left size n1 =46
Right size n2 =224
Volume m =323
Unique edge count m̿ =262
Wedge count s =5,294
Claw count z =126,361
Cross count x =2,457,723
Square count q =70
4-Tour count T4 =22,324
Maximum degree dmax =89
Maximum left degree d1max =89
Maximum right degree d2max =9
Average degree d =2.392 59
Average left degree d1 =7.021 74
Average right degree d2 =1.441 96
Fill p =0.025 427 0
Average edge multiplicity m̃ =1.232 82
Size of LCC N =104
Diameter δ =6
50-Percentile effective diameter δ0.5 =1.621 24
90-Percentile effective diameter δ0.9 =3.402 67
Median distance δM =2
Mean distance δm =2.344 97
Gini coefficient G =0.570 364
Balanced inequality ratio P =0.273 994
Left balanced inequality ratio P1 =0.207 430
Right balanced inequality ratio P2 =0.405 573
Relative edge distribution entropy Her =0.839 937
Power law exponent γ =5.194 80
Tail power law exponent γt =2.661 00
Tail power law exponent with p γ3 =2.661 00
p-value p =0.011 000 0
Left tail power law exponent with p γ3,1 =2.141 00
Left p-value p1 =0.090 000 0
Right tail power law exponent with p γ3,2 =5.351 00
Right p-value p2 =0.268 000
Degree assortativity ρ =−0.319 853
Degree assortativity p-value pρ =1.208 59 × 10−7
Spectral norm α =10.692 5
Algebraic connectivity a =0.175 243
Spectral separation 1[A] / λ2[A]| =1.102 13
Controllability C =178
Relative controllability Cr =0.659 259


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.