Wikipedia edits (ce)

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

Metadata

Codece
Internal nameedit-cewiki
NameWikipedia edits (ce)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
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

Statistics

Size n =187,459
Left size n1 =1,416
Right size n2 =186,043
Volume m =1,776,311
Unique edge count m̿ =601,347
Wedge count s =35,361,004,668
Claw count z =1,726,921,653,891,769
Cross count x =6.594 × 1019
Square count q =29,210,491,286
4-Tour count T4 =375,129,672,218
Maximum degree dmax =846,382
Maximum left degree d1max =846,382
Maximum right degree d2max =2,469
Average degree d =18.951 5
Average left degree d1 =1,254.46
Average right degree d2 =9.547 85
Fill p =0.002 282 70
Average edge multiplicity m̃ =2.953 89
Size of LCC N =186,763
Diameter δ =12
50-Percentile effective diameter δ0.5 =1.622 06
90-Percentile effective diameter δ0.9 =3.265 44
Median distance δM =2
Mean distance δm =2.336 85
Gini coefficient G =0.663 637
Balanced inequality ratio P =0.263 162
Left balanced inequality ratio P1 =0.014 040 3
Right balanced inequality ratio P2 =0.383 721
Relative edge distribution entropy Her =0.638 127
Power law exponent γ =1.937 03
Tail power law exponent γt =2.151 00
Degree assortativity ρ =−0.307 204
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,832.52
Algebraic connectivity a =0.065 521 7

Plots

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

Edge weight/multiplicity distribution

Temporal distribution

Diameter/density evolution

Matrix decompositions plots

Downloads

References

[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. http://dumps.wikimedia.org/, January 2010.