Wiktionary edits (to)

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


Internal nameedit-towiktionary
NameWiktionary edits (to)
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 =248
Left size n1 =32
Right size n2 =216
Volume m =248
Unique edge count m̿ =232
Wedge count s =5,785
Claw count z =141,114
Cross count x =2,577,278
Square count q =12
4-Tour count T4 =24,008
Maximum degree dmax =78
Maximum left degree d1max =78
Maximum right degree d2max =11
Average degree d =2.000 00
Average left degree d1 =7.750 00
Average right degree d2 =1.148 15
Fill p =0.033 564 8
Average edge multiplicity m̃ =1.068 97
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.526 471
Balanced inequality ratio P =0.300 403
Left balanced inequality ratio P1 =0.213 710
Right balanced inequality ratio P2 =0.459 677
Relative edge distribution entropy Her =0.807 563
Power law exponent γ =7.165 11
Tail power law exponent γt =3.011 00
Tail power law exponent with p γ3 =3.011 00
p-value p =0.007 000 00
Left tail power law exponent with p γ3,1 =2.101 00
Left p-value p1 =0.677 000
Right tail power law exponent with p γ3,2 =4.511 00
Right p-value p2 =0.408 000
Degree assortativity ρ =−0.351 277
Degree assortativity p-value pρ =3.845 45 × 10−8
Spectral norm α =8.831 76
Spectral separation 1[A] / λ2[A]| =1.026 67
Controllability C =184
Relative controllability Cr =0.741 935


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.