Wikiquote edits (co)

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


Internal nameedit-cowikiquote
NameWikiquote edits (co)
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 =270
Left size n1 =60
Right size n2 =210
Volume m =315
Unique edge count m̿ =243
Wedge count s =5,355
Claw count z =167,255
Cross count x =4,083,969
Square count q =30
4-Tour count T4 =22,186
Maximum degree dmax =106
Maximum left degree d1max =106
Maximum right degree d2max =39
Average degree d =2.333 33
Average left degree d1 =5.250 00
Average right degree d2 =1.500 00
Fill p =0.019 285 7
Average edge multiplicity m̃ =1.296 30
Size of LCC N =118
Diameter δ =6
50-Percentile effective diameter δ0.5 =1.618 30
90-Percentile effective diameter δ0.9 =3.345 76
Median distance δM =2
Mean distance δm =2.333 83
Gini coefficient G =0.577 143
Relative edge distribution entropy Her =0.851 065
Power law exponent γ =5.567 58
Tail power law exponent γt =2.741 00
Degree assortativity ρ =−0.289 707
Degree assortativity p-value pρ =4.397 52 × 10−6
Algebraic connectivity a =0.057 440 0
Controllability C =152
Relative controllability Cr =0.562 963


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.