Wiktionary edits (vo)

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

Metadata

Codemvo
Internal nameedit-vowiktionary
NameWiktionary 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 =25,457
Left size n1 =255
Right size n2 =25,202
Volume m =195,457
Unique edge count m̿ =105,029
Wedge count s =791,971,282
Claw count z =5,145,349,553,544
Cross count x =26,184,767,519,747,060
Square count q =913,424,636
4-Tour count T4 =10,475,506,342
Maximum degree dmax =74,293
Maximum left degree d1max =74,293
Maximum right degree d2max =137
Average degree d =15.355 9
Average left degree d1 =766.498
Average right degree d2 =7.755 61
Fill p =0.016 343 1
Average edge multiplicity m̃ =1.860 98
Size of LCC N =25,177
Diameter δ =15
50-Percentile effective diameter δ0.5 =1.561 87
90-Percentile effective diameter δ0.9 =3.114 54
Median distance δM =2
Mean distance δm =2.318 85
Gini coefficient G =0.657 293
Balanced inequality ratio P =0.257 860
Left balanced inequality ratio P1 =0.039 093 0
Right balanced inequality ratio P2 =0.392 813
Relative edge distribution entropy Her =0.679 620
Power law exponent γ =1.763 25
Tail power law exponent γt =3.551 00
Degree assortativity ρ =−0.425 511
Degree assortativity p-value pρ =0.000 00
Spectral norm α =649.206
Algebraic connectivity a =0.019 710 1

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

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.