Wikipedia edits (vo)

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

Metadata

Codevo
Internal nameedit-vowiki
NameWikipedia edits (vo)
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 =251,379
Left size n1 =2,658
Right size n2 =248,721
Volume m =3,159,242
Unique edge count m̿ =1,562,889
Wedge count s =60,125,724,903
Claw count z =2,976,067,036,131,336
Cross count x =1.452 32 × 1020
Square count q =111,928,252,235
4-Tour count T4 =1,135,932,379,110
Maximum degree dmax =1,157,637
Maximum left degree d1max =1,157,637
Maximum right degree d2max =1,043
Average degree d =25.135 3
Average left degree d1 =1,188.58
Average right degree d2 =12.702 0
Fill p =0.002 364 07
Average edge multiplicity m̃ =2.021 41
Size of LCC N =250,073
Diameter δ =15
50-Percentile effective diameter δ0.5 =1.580 12
90-Percentile effective diameter δ0.9 =2.511 52
Median distance δM =2
Mean distance δm =2.207 86
Gini coefficient G =0.788 123
Balanced inequality ratio P =0.213 521
Left balanced inequality ratio P1 =0.020 616 3
Right balanced inequality ratio P2 =0.285 386
Relative edge distribution entropy Her =0.681 727
Power law exponent γ =1.871 00
Tail power law exponent γt =5.501 00
Degree assortativity ρ =−0.441 939
Degree assortativity p-value pρ =0.000 00
Spectral norm α =3,594.74

Plots

Degree distribution

Cumulative degree distribution

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

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.