Wikipedia edits (uz)

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

Metadata

Codeuz
Internal nameedit-uzwiki
NameWikipedia edits (uz)
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 =619,358
Left size n1 =3,951
Right size n2 =615,407
Volume m =1,802,425
Unique edge count m̿ =1,259,549
Wedge count s =122,820,219,068
Claw count z =15,988,980,125,482,214
Cross count x =1.750 82 × 1021
Square count q =18,479,003,101
4-Tour count T4 =639,117,898,402
Maximum degree dmax =513,316
Maximum left degree d1max =513,316
Maximum right degree d2max =2,880
Average degree d =5.820 30
Average left degree d1 =456.195
Average right degree d2 =2.928 83
Fill p =0.000 518 019
Average edge multiplicity m̃ =1.431 01
Size of LCC N =617,456
Diameter δ =11
50-Percentile effective diameter δ0.5 =1.964 22
90-Percentile effective diameter δ0.9 =3.845 79
Median distance δM =2
Mean distance δm =2.990 95
Gini coefficient G =0.793 388
Balanced inequality ratio P =0.166 507
Left balanced inequality ratio P1 =0.020 201 7
Right balanced inequality ratio P2 =0.254 905
Relative edge distribution entropy Her =0.644 777
Power law exponent γ =3.774 51
Degree assortativity ρ =−0.448 591
Degree assortativity p-value pρ =0.000 00
Spectral norm α =3,213.69

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.