Wikipedia edits (sw)

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

Metadata

Codesw
Internal nameedit-swwiki
NameWikipedia edits (sw)
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 =90,112
Left size n1 =3,800
Right size n2 =86,312
Volume m =973,846
Unique edge count m̿ =484,536
Wedge count s =2,503,347,769
Claw count z =13,075,039,284,070
Cross count x =60,742,890,021,500,040
Square count q =5,765,717,831
4-Tour count T4 =56,140,274,560
Maximum degree dmax =69,412
Maximum left degree d1max =69,412
Maximum right degree d2max =1,378
Average degree d =21.614 1
Average left degree d1 =256.275
Average right degree d2 =11.282 9
Fill p =0.001 477 31
Average edge multiplicity m̃ =2.009 85
Size of LCC N =87,925
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.301 74
90-Percentile effective diameter δ0.9 =3.899 65
Median distance δM =4
Mean distance δm =3.490 80
Gini coefficient G =0.848 440
Balanced inequality ratio P =0.156 539
Left balanced inequality ratio P1 =0.030 077 7
Right balanced inequality ratio P2 =0.218 633
Relative edge distribution entropy Her =0.720 737
Power law exponent γ =2.041 47
Tail power law exponent γt =3.351 00
Degree assortativity ρ =−0.239 030
Degree assortativity p-value pρ =0.000 00
Spectral norm α =1,314.65
Algebraic connectivity a =0.055 978 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.