Wikibooks edits (mn)

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


Internal nameedit-mnwikibooks
NameWikibooks edits (mn)
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 =253
Left size n1 =43
Right size n2 =210
Volume m =388
Unique edge count m̿ =257
Wedge count s =5,759
Claw count z =152,476
Cross count x =3,386,460
Square count q =437
4-Tour count T4 =27,090
Maximum degree dmax =102
Maximum left degree d1max =102
Maximum right degree d2max =43
Average degree d =3.067 19
Average left degree d1 =9.023 26
Average right degree d2 =1.847 62
Fill p =0.028 460 7
Average edge multiplicity m̃ =1.509 73
Size of LCC N =105
Diameter δ =6
50-Percentile effective diameter δ0.5 =1.522 56
90-Percentile effective diameter δ0.9 =1.969 20
Median distance δM =2
Mean distance δm =2.065 34
Gini coefficient G =0.626 930
Balanced inequality ratio P =0.260 309
Left balanced inequality ratio P1 =0.177 835
Right balanced inequality ratio P2 =0.345 361
Relative edge distribution entropy Her =0.829 426
Power law exponent γ =4.811 69
Tail power law exponent γt =2.581 00
Tail power law exponent with p γ3 =2.581 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.781 00
Left p-value p1 =0.200 000
Right tail power law exponent with p γ3,2 =5.781 00
Right p-value p2 =0.047 000 0
Degree assortativity ρ =−0.299 204
Degree assortativity p-value pρ =1.031 08 × 10−6
Spectral norm α =43.266 6
Algebraic connectivity a =0.143 370
Spectral separation 1[A] / λ2[A]| =2.528 09
Controllability C =171
Relative controllability Cr =0.681 275


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.