Wiktionary edits (sr)

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

Metadata

Codemsr
Internal nameedit-srwiktionary
NameWiktionary edits (sr)
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 =220,994
Left size n1 =668
Right size n2 =220,326
Volume m =457,733
Unique edge count m̿ =288,246
Wedge count s =14,670,926,427
Claw count z =774,381,249,922,132
Cross count x =3.197 82 × 1019
Square count q =223,056,243
4-Tour count T4 =60,468,804,796
Maximum degree dmax =269,715
Maximum left degree d1max =269,715
Maximum right degree d2max =1,022
Average degree d =4.142 49
Average left degree d1 =685.229
Average right degree d2 =2.077 53
Fill p =0.001 958 49
Average edge multiplicity m̃ =1.587 99
Size of LCC N =219,692
Diameter δ =12
50-Percentile effective diameter δ0.5 =1.867 14
90-Percentile effective diameter δ0.9 =3.774 93
Median distance δM =2
Mean distance δm =2.857 38
Gini coefficient G =0.684 902
Balanced inequality ratio P =0.244 914
Left balanced inequality ratio P1 =0.030 731 9
Right balanced inequality ratio P2 =0.369 945
Relative edge distribution entropy Her =0.626 238
Power law exponent γ =7.749 28
Tail power law exponent γt =3.101 00
Degree assortativity ρ =−0.562 736
Degree assortativity p-value pρ =0.000 00
Spectral norm α =714.247
Algebraic connectivity a =0.025 897 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

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.