Wikibooks edits (da)

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


Internal nameedit-dawikibooks
NameWikibooks edits (da)
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 =4,567
Left size n1 =479
Right size n2 =4,088
Volume m =17,832
Unique edge count m̿ =7,257
Wedge count s =1,576,106
Claw count z =548,226,998
Cross count x =181,074,985,240
Square count q =138,225
4-Tour count T4 =7,433,470
Maximum degree dmax =3,090
Maximum left degree d1max =3,090
Maximum right degree d2max =278
Average degree d =7.809 07
Average left degree d1 =37.227 6
Average right degree d2 =4.362 04
Fill p =0.003 706 05
Average edge multiplicity m̃ =2.457 21
Size of LCC N =4,122
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.558 39
90-Percentile effective diameter δ0.9 =5.691 36
Median distance δM =4
Mean distance δm =4.220 90
Gini coefficient G =0.780 038
Balanced inequality ratio P =0.189 295
Left balanced inequality ratio P1 =0.100 213
Right balanced inequality ratio P2 =0.264 693
Relative edge distribution entropy Her =0.796 453
Power law exponent γ =3.030 11
Tail power law exponent γt =2.941 00
Tail power law exponent with p γ3 =2.941 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.721 00
Left p-value p1 =0.228 000
Right tail power law exponent with p γ3,2 =3.481 00
Right p-value p2 =0.007 000 00
Degree assortativity ρ =−0.105 816
Degree assortativity p-value pρ =1.593 99 × 10−19
Spectral norm α =581.918
Algebraic connectivity a =0.029 929 1
Spectral separation 1[A] / λ2[A]| =1.633 96
Controllability C =3,588
Relative controllability Cr =0.803 044


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.