Wiktionary edits (tg)

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


Internal nameedit-tgwiktionary
NameWiktionary edits (tg)
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 =33,968
Left size n1 =256
Right size n2 =33,712
Volume m =81,516
Unique edge count m̿ =64,892
Wedge count s =344,415,589
Claw count z =1,683,154,306,264
Cross count x =6,915,945,090,791,911
Square count q =144,612,668
4-Tour count T4 =2,534,693,792
Maximum degree dmax =20,227
Maximum left degree d1max =20,227
Maximum right degree d2max =51
Average degree d =4.799 58
Average left degree d1 =318.422
Average right degree d2 =2.418 01
Fill p =0.007 519 11
Average edge multiplicity m̃ =1.256 18
Size of LCC N =27,553
Diameter δ =15
50-Percentile effective diameter δ0.5 =1.952 64
90-Percentile effective diameter δ0.9 =3.816 66
Median distance δM =2
Mean distance δm =2.983 21
Gini coefficient G =0.673 199
Balanced inequality ratio P =0.252 791
Left balanced inequality ratio P1 =0.054 664 1
Right balanced inequality ratio P2 =0.375 754
Relative edge distribution entropy Her =0.673 482
Power law exponent γ =2.348 62
Tail power law exponent γt =4.781 00
Tail power law exponent with p γ3 =4.781 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.431 00
Left p-value p1 =0.262 000
Right tail power law exponent with p γ3,2 =5.091 00
Right p-value p2 =0.006 000 00
Degree assortativity ρ =−0.124 396
Degree assortativity p-value pρ =4.487 50 × 10−222
Spectral norm α =261.644
Algebraic connectivity a =0.004 140 95
Spectral separation 1[A] / λ2[A]| =1.316 38
Controllability C =27,264
Relative controllability Cr =0.982 133


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.