Wikipedia edits (aa)

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


Internal nameedit-aawiki
NameWikipedia edits (aa)
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 =689
Left size n1 =182
Right size n2 =507
Volume m =1,189
Unique edge count m̿ =743
Wedge count s =18,399
Claw count z =590,315
Cross count x =15,175,349
Square count q =4,752
4-Tour count T4 =113,166
Maximum degree dmax =202
Maximum left degree d1max =202
Maximum right degree d2max =28
Average degree d =3.451 38
Average left degree d1 =6.532 97
Average right degree d2 =2.345 17
Fill p =0.008 052 11
Average edge multiplicity m̃ =1.600 27
Size of LCC N =354
Diameter δ =15
50-Percentile effective diameter δ0.5 =4.543 98
90-Percentile effective diameter δ0.9 =6.990 48
Median distance δM =5
Mean distance δm =4.980 43
Gini coefficient G =0.605 679
Balanced inequality ratio P =0.273 759
Left balanced inequality ratio P1 =0.222 876
Right balanced inequality ratio P2 =0.330 530
Relative edge distribution entropy Her =0.865 676
Power law exponent γ =3.842 12
Tail power law exponent γt =2.361 00
Tail power law exponent with p γ3 =2.361 00
p-value p =0.879 000
Left tail power law exponent with p γ3,1 =2.331 00
Left p-value p1 =0.252 000
Right tail power law exponent with p γ3,2 =4.451 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.228 462
Degree assortativity p-value pρ =2.967 78 × 10−10
Spectral norm α =34.790 7
Algebraic connectivity a =0.022 225 0
Spectral separation 1[A] / λ2[A]| =1.564 03
Controllability C =347
Relative controllability Cr =0.506 569


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.