Wikibooks edits (eo)

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


Internal nameedit-eowikibooks
NameWikibooks edits (eo)
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 =3,672
Left size n1 =401
Right size n2 =3,271
Volume m =13,811
Unique edge count m̿ =4,776
Wedge count s =875,403
Claw count z =291,793,516
Cross count x =84,687,362,984
Square count q =31,118
4-Tour count T4 =3,760,692
Maximum degree dmax =4,729
Maximum left degree d1max =4,729
Maximum right degree d2max =160
Average degree d =7.522 33
Average left degree d1 =34.441 4
Average right degree d2 =4.222 26
Fill p =0.003 641 16
Average edge multiplicity m̃ =2.891 75
Size of LCC N =3,259
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.675 72
90-Percentile effective diameter δ0.9 =5.913 19
Median distance δM =4
Mean distance δm =4.438 43
Gini coefficient G =0.774 863
Balanced inequality ratio P =0.188 002
Left balanced inequality ratio P1 =0.113 822
Right balanced inequality ratio P2 =0.263 486
Relative edge distribution entropy Her =0.806 765
Power law exponent γ =3.846 79
Tail power law exponent γt =2.341 00
Tail power law exponent with p γ3 =2.341 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.701 00
Left p-value p1 =0.565 000
Right tail power law exponent with p γ3,2 =3.511 00
Right p-value p2 =0.618 000
Degree assortativity ρ =−0.144 328
Degree assortativity p-value pρ =1.192 59 × 10−23
Spectral norm α =257.575
Algebraic connectivity a =0.039 562 1
Spectral separation 1[A] / λ2[A]| =1.245 88
Controllability C =2,799
Relative controllability Cr =0.786 899


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.