Wikiquote edits (am)

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


Internal nameedit-amwikiquote
NameWikiquote edits (am)
Data source
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 =555
Left size n1 =138
Right size n2 =417
Volume m =630
Unique edge count m̿ =475
Wedge count s =14,547
Claw count z =764,028
Cross count x =31,260,580
Square count q =35
4-Tour count T4 =59,426
Maximum degree dmax =182
Maximum left degree d1max =182
Maximum right degree d2max =42
Average degree d =2.270 27
Average left degree d1 =4.565 22
Average right degree d2 =1.510 79
Fill p =0.008 254 27
Average edge multiplicity m̃ =1.326 32
Size of LCC N =246
Diameter δ =12
50-Percentile effective diameter δ0.5 =2.112 40
90-Percentile effective diameter δ0.9 =4.844 39
Median distance δM =3
Mean distance δm =3.166 27
Gini coefficient G =0.547 963
Balanced inequality ratio P =0.291 270
Left balanced inequality ratio P1 =0.246 032
Right balanced inequality ratio P2 =0.393 651
Relative edge distribution entropy Her =0.867 261
Power law exponent γ =5.891 15
Tail power law exponent γt =2.801 00
Tail power law exponent with p γ3 =2.801 00
p-value p =0.074 000 0
Left tail power law exponent with p γ3,1 =2.401 00
Left p-value p1 =0.430 000
Right tail power law exponent with p γ3,2 =4.991 00
Right p-value p2 =0.866 000
Degree assortativity ρ =−0.179 643
Degree assortativity p-value pρ =8.251 26 × 10−5
Spectral norm α =42.332 0
Algebraic connectivity a =0.036 098 3
Controllability C =284
Relative controllability Cr =0.514 493


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., January 2010.