Wiktionary edits (ug)

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


Internal nameedit-ugwiktionary
NameWiktionary edits (ug)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
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


Size n =3,826
Left size n1 =197
Right size n2 =3,629
Volume m =25,269
Unique edge count m̿ =12,229
Wedge count s =5,724,095
Claw count z =2,626,296,462
Cross count x =1,085,987,729,917
Square count q =6,462,958
4-Tour count T4 =74,624,822
Maximum degree dmax =4,805
Maximum left degree d1max =4,805
Maximum right degree d2max =92
Average degree d =13.209 1
Average left degree d1 =128.269
Average right degree d2 =6.963 08
Fill p =0.017 105 6
Average edge multiplicity m̃ =2.066 32
Size of LCC N =3,586
Diameter δ =14
50-Percentile effective diameter δ0.5 =1.914 97
90-Percentile effective diameter δ0.9 =3.871 11
Median distance δM =2
Mean distance δm =2.985 90
Gini coefficient G =0.782 405
Balanced inequality ratio P =0.193 795
Left balanced inequality ratio P1 =0.069 690 1
Right balanced inequality ratio P2 =0.261 308
Relative edge distribution entropy Her =0.738 449
Power law exponent γ =2.239 82
Tail power law exponent γt =1.791 00
Tail power law exponent with p γ3 =1.791 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.561 00
Left p-value p1 =0.003 000 00
Right tail power law exponent with p γ3,2 =1.811 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.376 728
Degree assortativity p-value pρ =0.000 00
Spectral norm α =240.555
Algebraic connectivity a =0.015 443 4
Spectral separation 1[A] / λ2[A]| =1.090 66
Controllability C =3,424
Relative controllability Cr =0.897 745


Fruchterman–Reingold graph drawing

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

Double Laplacian graph drawing

Delaunay graph drawing

Edge weight/multiplicity distribution

Temporal distribution

Temporal hop distribution

Diameter/density evolution

Matrix decompositions plots



[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.