Wikiquote edits (simple)

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


Internal nameedit-simplewikiquote
NameWikiquote edits (simple)
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 =6,366
Left size n1 =427
Right size n2 =5,939
Volume m =27,042
Unique edge count m̿ =12,552
Wedge count s =3,782,622
Claw count z =1,424,889,954
Cross count x =491,621,668,983
Square count q =794,497
4-Tour count T4 =21,513,780
Maximum degree dmax =5,260
Maximum left degree d1max =5,260
Maximum right degree d2max =1,072
Average degree d =8.495 76
Average left degree d1 =63.330 2
Average right degree d2 =4.553 29
Fill p =0.004 949 62
Average edge multiplicity m̃ =2.154 40
Size of LCC N =6,227
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.402 92
90-Percentile effective diameter δ0.9 =3.938 94
Median distance δM =4
Mean distance δm =3.728 96
Gini coefficient G =0.825 845
Balanced inequality ratio P =0.149 656
Left balanced inequality ratio P1 =0.100 695
Right balanced inequality ratio P2 =0.214 148
Relative edge distribution entropy Her =0.767 615
Power law exponent γ =3.253 81
Tail power law exponent γt =2.171 00
Tail power law exponent with p γ3 =2.171 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.571 00
Left p-value p1 =0.960 000
Right tail power law exponent with p γ3,2 =2.271 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.288 093
Degree assortativity p-value pρ =1.854 47 × 10−238
Spectral norm α =397.261
Algebraic connectivity a =0.087 645 1
Spectral separation 1[A] / λ2[A]| =2.492 88
Controllability C =5,619
Relative controllability Cr =0.884 464


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.