Wiktionary edits (mn)

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

Metadata

Codemmn
Internal nameedit-mnwiktionary
NameWiktionary edits (mn)
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 =46,998
Left size n1 =415
Right size n2 =46,583
Volume m =227,450
Unique edge count m̿ =80,054
Wedge count s =752,918,045
Claw count z =8,295,808,288,089
Cross count x =74,116,792,628,850,688
Square count q =61,290,927
4-Tour count T4 =3,502,160,012
Maximum degree dmax =149,443
Maximum left degree d1max =149,443
Maximum right degree d2max =209
Average degree d =9.679 14
Average left degree d1 =548.072
Average right degree d2 =4.882 68
Fill p =0.004 141 02
Average edge multiplicity m̃ =2.841 21
Size of LCC N =43,704
Diameter δ =15
50-Percentile effective diameter δ0.5 =1.743 29
90-Percentile effective diameter δ0.9 =3.740 92
Median distance δM =2
Mean distance δm =2.697 14
Gini coefficient G =0.622 795
Balanced inequality ratio P =0.282 113
Left balanced inequality ratio P1 =0.066 353 0
Right balanced inequality ratio P2 =0.414 592
Relative edge distribution entropy Her =0.675 177
Power law exponent γ =3.050 16
Tail power law exponent γt =3.521 00
Degree assortativity ρ =−0.404 011
Degree assortativity p-value pρ =0.000 00
Spectral norm α =884.093
Algebraic connectivity a =0.009 158 53

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.