Wikibooks edits (ro)

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


Internal nameedit-rowikibooks
NameWikibooks edits (ro)
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,740
Left size n1 =443
Right size n2 =4,297
Volume m =18,527
Unique edge count m̿ =6,974
Wedge count s =1,632,946
Claw count z =467,715,409
Cross count x =120,906,196,265
Square count q =156,041
4-Tour count T4 =7,794,280
Maximum degree dmax =4,384
Maximum left degree d1max =4,384
Maximum right degree d2max =268
Average degree d =7.817 30
Average left degree d1 =41.821 7
Average right degree d2 =4.311 61
Fill p =0.003 663 64
Average edge multiplicity m̃ =2.656 58
Size of LCC N =4,315
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.676 97
90-Percentile effective diameter δ0.9 =5.834 41
Median distance δM =4
Mean distance δm =4.463 71
Gini coefficient G =0.799 692
Balanced inequality ratio P =0.173 315
Left balanced inequality ratio P1 =0.086 522 4
Right balanced inequality ratio P2 =0.253 468
Relative edge distribution entropy Her =0.782 637
Power law exponent γ =3.441 12
Tail power law exponent γt =3.011 00
Tail power law exponent with p γ3 =3.011 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.751 00
Left p-value p1 =0.043 000 0
Right tail power law exponent with p γ3,2 =4.111 00
Right p-value p2 =0.428 000
Degree assortativity ρ =−0.144 191
Degree assortativity p-value pρ =1.023 27 × 10−33
Spectral norm α =587.661
Algebraic connectivity a =0.023 570 6
Spectral separation 1[A] / λ2[A]| =1.560 37
Controllability C =3,882
Relative controllability Cr =0.832 333


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.