Wiktionary edits (tk)

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


Internal nameedit-tkwiktionary
NameWiktionary edits (tk)
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 =5,810
Left size n1 =211
Right size n2 =5,599
Volume m =20,603
Unique edge count m̿ =13,065
Wedge count s =12,689,094
Claw count z =13,382,605,535
Cross count x =12,484,933,019,076
Square count q =6,477,068
4-Tour count T4 =102,599,358
Maximum degree dmax =4,718
Maximum left degree d1max =4,718
Maximum right degree d2max =47
Average degree d =7.092 25
Average left degree d1 =97.644 5
Average right degree d2 =3.679 76
Fill p =0.011 059 0
Average edge multiplicity m̃ =1.576 96
Size of LCC N =5,294
Diameter δ =14
50-Percentile effective diameter δ0.5 =1.678 91
90-Percentile effective diameter δ0.9 =4.597 87
Median distance δM =2
Mean distance δm =2.909 44
Gini coefficient G =0.774 014
Balanced inequality ratio P =0.191 865
Left balanced inequality ratio P1 =0.057 564 4
Right balanced inequality ratio P2 =0.275 639
Relative edge distribution entropy Her =0.704 448
Power law exponent γ =2.691 04
Tail power law exponent γt =2.621 00
Tail power law exponent with p γ3 =2.621 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.481 00
Left p-value p1 =0.234 000
Right tail power law exponent with p γ3,2 =8.991 00
Right p-value p2 =0.019 000 0
Degree assortativity ρ =−0.395 787
Degree assortativity p-value pρ =0.000 00
Spectral norm α =184.341
Algebraic connectivity a =0.004 354 02
Spectral separation 1[A] / λ2[A]| =1.617 41
Controllability C =5,219
Relative controllability Cr =0.929 475


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.