Wikiquote edits (et)

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


Internal nameedit-etwikisource
NameWikiquote edits (et)
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 =20,902
Left size n1 =274
Right size n2 =20,628
Volume m =37,403
Unique edge count m̿ =32,655
Wedge count s =153,341,286
Claw count z =606,196,798,396
Cross count x =1,922,372,201,202,177
Square count q =25,304,229
4-Tour count T4 =815,888,542
Maximum degree dmax =14,395
Maximum left degree d1max =14,395
Maximum right degree d2max =187
Average degree d =3.578 89
Average left degree d1 =136.507
Average right degree d2 =1.813 22
Fill p =0.005 777 53
Average edge multiplicity m̃ =1.145 40
Size of LCC N =20,575
Diameter δ =13
50-Percentile effective diameter δ0.5 =1.796 85
90-Percentile effective diameter δ0.9 =3.776 27
Median distance δM =2
Mean distance δm =2.789 74
Gini coefficient G =0.629 944
Balanced inequality ratio P =0.279 242
Left balanced inequality ratio P1 =0.047 883 9
Right balanced inequality ratio P2 =0.407 962
Relative edge distribution entropy Her =0.652 436
Power law exponent γ =3.525 59
Tail power law exponent γt =5.801 00
Tail power law exponent with p γ3 =5.801 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.511 00
Left p-value p1 =0.804 000
Right tail power law exponent with p γ3,2 =6.511 00
Right p-value p2 =0.005 000 00
Degree assortativity ρ =−0.229 507
Degree assortativity p-value pρ =0.000 00
Spectral norm α =277.982
Algebraic connectivity a =0.015 024 5
Spectral separation 1[A] / λ2[A]| =1.722 13
Controllability C =20,366
Relative controllability Cr =0.976 038


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.