Wikipedia edits (cy)

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

Metadata

Codecy
Internal nameedit-cywiki
NameWikipedia edits (cy)
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 =208,087
Left size n1 =5,445
Right size n2 =202,642
Volume m =2,767,004
Unique edge count m̿ =979,109
Wedge count s =13,498,204,503
Claw count z =292,097,112,413,717
Cross count x =6,634,120,022,693,724,160
Square count q =15,119,863,031
4-Tour count T4 =174,955,343,246
Maximum degree dmax =843,214
Maximum left degree d1max =843,214
Maximum right degree d2max =4,705
Average degree d =26.594 7
Average left degree d1 =508.173
Average right degree d2 =13.654 6
Fill p =0.000 887 368
Average edge multiplicity m̃ =2.826 04
Size of LCC N =206,776
Diameter δ =12
50-Percentile effective diameter δ0.5 =2.815 10
90-Percentile effective diameter δ0.9 =3.818 99
Median distance δM =3
Mean distance δm =3.050 00
Gini coefficient G =0.856 885
Balanced inequality ratio P =0.152 148
Left balanced inequality ratio P1 =0.020 623 4
Right balanced inequality ratio P2 =0.209 617
Relative edge distribution entropy Her =0.709 558
Power law exponent γ =2.039 13
Tail power law exponent γt =3.271 00
Degree assortativity ρ =−0.313 663
Degree assortativity p-value pρ =0.000 00
Spectral norm α =9,487.20

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.