Wikipedia edits (am)

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

Metadata

Codeam
Internal nameedit-amwiki
NameWikipedia edits (am)
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 =45,123
Left size n1 =1,873
Right size n2 =43,250
Volume m =314,419
Unique edge count m̿ =144,012
Wedge count s =309,489,596
Claw count z =861,425,558,648
Cross count x =2,417,381,224,716,798
Square count q =493,722,067
4-Tour count T4 =5,188,059,520
Maximum degree dmax =29,442
Maximum left degree d1max =29,442
Maximum right degree d2max =364
Average degree d =13.936 1
Average left degree d1 =167.869
Average right degree d2 =7.269 80
Fill p =0.001 777 77
Average edge multiplicity m̃ =2.183 28
Size of LCC N =43,157
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.491 35
90-Percentile effective diameter δ0.9 =5.482 28
Median distance δM =4
Mean distance δm =3.977 65
Gini coefficient G =0.878 856
Balanced inequality ratio P =0.111 875
Left balanced inequality ratio P1 =0.039 809 9
Right balanced inequality ratio P2 =0.163 600
Relative edge distribution entropy Her =0.717 074
Power law exponent γ =2.878 58
Tail power law exponent γt =2.041 00
Degree assortativity ρ =−0.523 836
Degree assortativity p-value pρ =0.000 00
Spectral norm α =933.883
Algebraic connectivity a =0.016 650 2

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

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal distribution

Temporal hop 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.