Wikibooks edits (el)

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


Internal nameedit-elwikibooks
NameWikibooks edits (el)
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,953
Left size n1 =1,305
Right size n2 =3,648
Volume m =30,846
Unique edge count m̿ =7,144
Wedge count s =1,277,173
Claw count z =411,836,532
Cross count x =124,386,638,131
Square count q =136,177
4-Tour count T4 =6,212,668
Maximum degree dmax =4,533
Maximum left degree d1max =4,533
Maximum right degree d2max =3,295
Average degree d =12.455 5
Average left degree d1 =23.636 8
Average right degree d2 =8.455 59
Fill p =0.001 500 64
Average edge multiplicity m̃ =4.317 75
Size of LCC N =4,274
Diameter δ =13
50-Percentile effective diameter δ0.5 =4.174 91
90-Percentile effective diameter δ0.9 =5.858 42
Median distance δM =5
Mean distance δm =4.649 27
Gini coefficient G =0.828 008
Balanced inequality ratio P =0.155 790
Left balanced inequality ratio P1 =0.219 186
Right balanced inequality ratio P2 =0.145 335
Relative edge distribution entropy Her =0.808 760
Power law exponent γ =3.457 72
Tail power law exponent γt =2.231 00
Tail power law exponent with p γ3 =2.231 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =2.711 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =2.691 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.328 521
Degree assortativity p-value pρ =2.186 30 × 10−179
Spectral norm α =823.403
Algebraic connectivity a =0.025 113 8
Spectral separation 1[A] / λ2[A]| =2.011 62
Controllability C =3,598
Relative controllability Cr =0.774 763


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.