Wiktionary edits (tw)

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


Internal nameedit-twwiktionary
NameWiktionary edits (tw)
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 =260
Left size n1 =35
Right size n2 =225
Volume m =273
Unique edge count m̿ =247
Wedge count s =5,853
Claw count z =141,266
Cross count x =2,577,510
Square count q =25
4-Tour count T4 =24,414
Maximum degree dmax =78
Maximum left degree d1max =78
Maximum right degree d2max =10
Average degree d =2.100 00
Average left degree d1 =7.800 00
Average right degree d2 =1.213 33
Fill p =0.031 365 1
Average edge multiplicity m̃ =1.105 26
Size of LCC N =78
Diameter δ =2
50-Percentile effective diameter δ0.5 =1.481 26
90-Percentile effective diameter δ0.9 =1.896 25
Median distance δM =2
Mean distance δm =1.952 09
Gini coefficient G =0.537 843
Balanced inequality ratio P =0.289 377
Left balanced inequality ratio P1 =0.201 465
Right balanced inequality ratio P2 =0.446 886
Relative edge distribution entropy Her =0.815 720
Power law exponent γ =6.551 55
Tail power law exponent γt =2.911 00
Tail power law exponent with p γ3 =2.911 00
p-value p =0.021 000 0
Left tail power law exponent with p γ3,1 =1.941 00
Left p-value p1 =0.395 000
Right tail power law exponent with p γ3,2 =4.061 00
Right p-value p2 =0.056 000 0
Degree assortativity ρ =−0.395 307
Degree assortativity p-value pρ =1.150 94 × 10−10
Spectral norm α =8.831 76
Spectral separation 1[A] / λ2[A]| =1.026 67
Controllability C =192
Relative controllability Cr =0.738 462


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