Wiktionary edits (am)

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


Internal nameedit-amwiktionary
NameWiktionary edits (am)
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 =1,878
Left size n1 =259
Right size n2 =1,619
Volume m =10,969
Unique edge count m̿ =4,601
Wedge count s =531,747
Claw count z =61,002,051
Cross count x =6,346,371,429
Square count q =565,689
4-Tour count T4 =6,663,782
Maximum degree dmax =1,747
Maximum left degree d1max =1,747
Maximum right degree d2max =71
Average degree d =11.681 6
Average left degree d1 =42.351 4
Average right degree d2 =6.775 17
Fill p =0.010 972 5
Average edge multiplicity m̃ =2.384 05
Size of LCC N =1,548
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.759 86
90-Percentile effective diameter δ0.9 =5.965 94
Median distance δM =4
Mean distance δm =4.434 45
Gini coefficient G =0.783 161
Balanced inequality ratio P =0.187 756
Left balanced inequality ratio P1 =0.084 966 7
Right balanced inequality ratio P2 =0.240 861
Relative edge distribution entropy Her =0.794 270
Power law exponent γ =2.401 48
Tail power law exponent γt =1.861 00
Tail power law exponent with p γ3 =1.861 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.711 00
Left p-value p1 =0.004 000 00
Right tail power law exponent with p γ3,2 =1.891 00
Right p-value p2 =0.000 00
Degree assortativity ρ =+0.052 126 0
Degree assortativity p-value pρ =0.000 404 413
Spectral norm α =166.095
Algebraic connectivity a =0.026 075 7
Spectral separation 1[A] / λ2[A]| =1.514 17
Controllability C =1,355
Relative controllability Cr =0.728 886


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.