Wikipedia edits (min)

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

Metadata

Codemin
Internal nameedit-minwiki
NameWikipedia edits (min)
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 =317,818
Left size n1 =649
Right size n2 =317,169
Volume m =1,539,666
Unique edge count m̿ =610,094
Wedge count s =56,070,731,765
Claw count z =3,659,943,609,589,532
Cross count x =1.809 85 × 1020
Square count q =23,360,431,604
4-Tour count T4 =411,167,646,932
Maximum degree dmax =1,045,973
Maximum left degree d1max =1,045,973
Maximum right degree d2max =880
Average degree d =9.688 98
Average left degree d1 =2,372.37
Average right degree d2 =4.854 40
Fill p =0.002 963 88
Average edge multiplicity m̃ =2.523 65
Size of LCC N =317,508
Diameter δ =10
50-Percentile effective diameter δ0.5 =1.671 55
90-Percentile effective diameter δ0.9 =3.614 87
Median distance δM =2
Mean distance δm =2.515 22
Gini coefficient G =0.773 874
Balanced inequality ratio P =0.196 266
Left balanced inequality ratio P1 =0.009 733 28
Right balanced inequality ratio P2 =0.271 289
Relative edge distribution entropy Her =0.606 184
Power law exponent γ =2.830 72
Tail power law exponent γt =8.991 00
Degree assortativity ρ =−0.247 027
Degree assortativity p-value pρ =0.000 00
Spectral norm α =3,444.17
Algebraic connectivity a =0.015 264 8

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.