Wikiquote edits (en)

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


Internal nameedit-enwikisource
NameWikiquote edits (en)
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 =2,210,887
Left size n1 =18,038
Right size n2 =2,192,849
Volume m =6,561,379
Unique edge count m̿ =4,129,231
Wedge count s =192,477,058,220
Claw count z =11,964,977,906,617,664
Cross count x =7.080 63 × 1020
Maximum degree dmax =916,505
Maximum left degree d1max =916,505
Maximum right degree d2max =30,606
Average degree d =5.935 52
Average left degree d1 =363.753
Average right degree d2 =2.992 17
Average edge multiplicity m̃ =1.589 01
Size of LCC N =2,203,707
Diameter δ =15
50-Percentile effective diameter δ0.5 =3.546 28
90-Percentile effective diameter δ0.9 =5.215 17
Median distance δM =4
Mean distance δm =4.134 17
Gini coefficient G =0.725 227
Balanced inequality ratio P =0.222 712
Left balanced inequality ratio P1 =0.033 994 1
Right balanced inequality ratio P2 =0.331 631
Power law exponent γ =3.170 76
Tail power law exponent γt =1.571 00
Tail power law exponent with p γ3 =1.571 00
p-value p =0.170 000
Left tail power law exponent with p γ3,1 =1.541 00
Left p-value p1 =0.462 000
Right tail power law exponent with p γ3,2 =3.381 00
Right p-value p2 =0.003 000 00
Degree assortativity ρ =−0.060 458 0
Degree assortativity p-value pρ =0.000 00
Controllability C =2,178,890
Relative controllability Cr =0.986 758


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

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal distribution



[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.