Wiktionary edits (nah)

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


Internal nameedit-nahwiktionary
NameWiktionary edits (nah)
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 =9,196
Left size n1 =226
Right size n2 =8,970
Volume m =47,745
Unique edge count m̿ =28,697
Wedge count s =59,475,824
Claw count z =108,788,969,886
Cross count x =162,736,378,324,082
Square count q =45,888,128
4-Tour count T4 =605,066,046
Maximum degree dmax =12,711
Maximum left degree d1max =12,711
Maximum right degree d2max =209
Average degree d =10.383 9
Average left degree d1 =211.261
Average right degree d2 =5.322 74
Fill p =0.014 155 8
Average edge multiplicity m̃ =1.663 76
Size of LCC N =8,994
Diameter δ =13
50-Percentile effective diameter δ0.5 =1.670 69
90-Percentile effective diameter δ0.9 =5.278 65
Median distance δM =2
Mean distance δm =2.790 79
Gini coefficient G =0.724 427
Balanced inequality ratio P =0.228 380
Left balanced inequality ratio P1 =0.049 513 0
Right balanced inequality ratio P2 =0.329 626
Relative edge distribution entropy Her =0.692 657
Power law exponent γ =2.068 71
Tail power law exponent γt =3.521 00
Tail power law exponent with p γ3 =3.521 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.601 00
Left p-value p1 =0.002 000 00
Right tail power law exponent with p γ3,2 =7.471 00
Right p-value p2 =0.063 000 0
Degree assortativity ρ =−0.391 491
Degree assortativity p-value pρ =0.000 00
Algebraic connectivity a =0.012 691 2
Spectral separation 1[A] / λ2[A]| =1.287 29
Controllability C =8,761
Relative controllability Cr =0.952 800


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.