Wikibooks edits (no)

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


Internal nameedit-nowikibooks
NameWikibooks edits (no)
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,821
Left size n1 =688
Right size n2 =4,133
Volume m =29,595
Unique edge count m̿ =7,214
Wedge count s =937,692
Claw count z =176,097,231
Cross count x =29,659,558,962
Square count q =131,185
4-Tour count T4 =4,820,316
Maximum degree dmax =8,269
Maximum left degree d1max =8,269
Maximum right degree d2max =502
Average degree d =12.277 5
Average left degree d1 =43.016 0
Average right degree d2 =7.160 66
Fill p =0.002 537 01
Average edge multiplicity m̃ =4.102 44
Size of LCC N =4,273
Diameter δ =16
50-Percentile effective diameter δ0.5 =3.866 82
90-Percentile effective diameter δ0.9 =6.378 90
Median distance δM =4
Mean distance δm =4.860 01
Gini coefficient G =0.803 553
Balanced inequality ratio P =0.171 279
Left balanced inequality ratio P1 =0.146 477
Right balanced inequality ratio P2 =0.221 963
Relative edge distribution entropy Her =0.828 523
Power law exponent γ =3.021 42
Tail power law exponent γt =2.361 00
Tail power law exponent with p γ3 =2.361 00
p-value p =0.198 000
Left tail power law exponent with p γ3,1 =2.031 00
Left p-value p1 =0.017 000 0
Right tail power law exponent with p γ3,2 =3.261 00
Right p-value p2 =0.784 000
Degree assortativity ρ =−0.200 068
Degree assortativity p-value pρ =4.966 38 × 10−66
Spectral norm α =794.119
Spectral separation 1[A] / λ2[A]| =1.649 66
Controllability C =3,408
Relative controllability Cr =0.730 077


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.