Wiktionary edits (yo)

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


Internal nameedit-yowiktionary
NameWiktionary edits (yo)
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 =237
Left size n1 =27
Right size n2 =210
Volume m =254
Unique edge count m̿ =233
Wedge count s =5,899
Claw count z =141,604
Cross count x =2,578,608
Square count q =47
4-Tour count T4 =24,746
Maximum degree dmax =78
Maximum left degree d1max =78
Maximum right degree d2max =6
Average degree d =2.143 46
Average left degree d1 =9.407 41
Average right degree d2 =1.209 52
Fill p =0.041 093 5
Average edge multiplicity m̃ =1.090 13
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.542 651
Balanced inequality ratio P =0.289 370
Left balanced inequality ratio P1 =0.196 850
Right balanced inequality ratio P2 =0.448 819
Relative edge distribution entropy Her =0.800 212
Power law exponent γ =6.664 20
Tail power law exponent γt =2.931 00
Tail power law exponent with p γ3 =2.931 00
p-value p =0.004 000 00
Left tail power law exponent with p γ3,1 =1.671 00
Left p-value p1 =0.926 000
Right tail power law exponent with p γ3,2 =3.911 00
Right p-value p2 =0.139 000
Degree assortativity ρ =−0.508 147
Degree assortativity p-value pρ =1.061 01 × 10−16
Spectral norm α =8.831 76
Spectral separation 1[A] / λ2[A]| =1.026 67
Controllability C =187
Relative controllability Cr =0.789 030


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.