Wikipedia edits (co)

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


Internal nameedit-cowiki
NameWikipedia 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 =13,948
Left size n1 =1,552
Right size n2 =12,396
Volume m =177,084
Unique edge count m̿ =85,745
Wedge count s =77,227,773
Claw count z =74,671,414,047
Cross count x =66,498,136,662,479
Square count q =278,424,419
4-Tour count T4 =2,536,516,054
Maximum degree dmax =14,140
Maximum left degree d1max =14,140
Maximum right degree d2max =279
Average degree d =25.392 0
Average left degree d1 =114.101
Average right degree d2 =14.285 6
Fill p =0.004 456 93
Average edge multiplicity m̃ =2.065 24
Size of LCC N =11,947
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.152 57
90-Percentile effective diameter δ0.9 =4.412 90
Median distance δM =4
Mean distance δm =3.444 85
Gini coefficient G =0.846 320
Balanced inequality ratio P =0.159 419
Left balanced inequality ratio P1 =0.051 438 9
Right balanced inequality ratio P2 =0.205 479
Relative edge distribution entropy Her =0.765 972
Power law exponent γ =1.857 65
Tail power law exponent γt =1.611 00
Tail power law exponent with p γ3 =1.611 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.691 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =8.911 00
Right p-value p2 =0.072 000 0
Degree assortativity ρ =−0.223 269
Degree assortativity p-value pρ =0.000 00
Spectral norm α =672.627
Algebraic connectivity a =0.019 705 9
Spectral separation 1[A] / λ2[A]| =2.364 71
Controllability C =9,809
Relative controllability Cr =0.775 538


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.