Wikiquote edits (eo)

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


Internal nameedit-eowikisource
NameWikiquote 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 =7,681
Left size n1 =483
Right size n2 =7,198
Volume m =26,697
Unique edge count m̿ =11,829
Wedge count s =5,672,708
Claw count z =3,141,149,068
Cross count x =1,482,515,022,755
Square count q =366,939
4-Tour count T4 =25,669,494
Maximum degree dmax =5,900
Maximum left degree d1max =5,900
Maximum right degree d2max =328
Average degree d =6.951 44
Average left degree d1 =55.273 3
Average right degree d2 =3.708 95
Fill p =0.003 402 43
Average edge multiplicity m̃ =2.256 91
Size of LCC N =7,372
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.423 41
90-Percentile effective diameter δ0.9 =4.479 88
Median distance δM =4
Mean distance δm =3.785 18
Gini coefficient G =0.758 121
Balanced inequality ratio P =0.204 330
Left balanced inequality ratio P1 =0.082 743 4
Right balanced inequality ratio P2 =0.296 850
Relative edge distribution entropy Her =0.754 589
Power law exponent γ =3.633 11
Tail power law exponent γt =2.961 00
Tail power law exponent with p γ3 =2.961 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.611 00
Left p-value p1 =0.724 000
Right tail power law exponent with p γ3,2 =4.171 00
Right p-value p2 =0.165 000
Degree assortativity ρ =−0.191 198
Degree assortativity p-value pρ =8.697 63 × 10−98
Spectral norm α =334.135
Algebraic connectivity a =0.048 223 5
Spectral separation 1[A] / λ2[A]| =1.242 16
Controllability C =6,955
Relative controllability Cr =0.907 134


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.