Wikipedia edits (ab)

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


Internal nameedit-abwiki
NameWikipedia edits (ab)
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 =6,698
Left size n1 =1,166
Right size n2 =5,532
Volume m =39,606
Unique edge count m̿ =19,616
Wedge count s =4,660,057
Claw count z =1,757,781,515
Cross count x =718,574,163,348
Square count q =6,064,981
4-Tour count T4 =67,204,936
Maximum degree dmax =3,851
Maximum left degree d1max =3,851
Maximum right degree d2max =239
Average degree d =11.826 2
Average left degree d1 =33.967 4
Average right degree d2 =7.159 44
Fill p =0.003 041 09
Average edge multiplicity m̃ =2.019 07
Size of LCC N =5,766
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.584 73
90-Percentile effective diameter δ0.9 =5.599 08
Median distance δM =4
Mean distance δm =4.154 81
Gini coefficient G =0.827 078
Balanced inequality ratio P =0.156 302
Left balanced inequality ratio P1 =0.093 874 7
Right balanced inequality ratio P2 =0.193 582
Relative edge distribution entropy Her =0.790 417
Power law exponent γ =2.599 57
Tail power law exponent γt =2.371 00
Tail power law exponent with p γ3 =2.371 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.751 00
Left p-value p1 =0.001 000 00
Right tail power law exponent with p γ3,2 =5.191 00
Right p-value p2 =0.109 000
Degree assortativity ρ =−0.288 527
Degree assortativity p-value pρ =0.000 00
Spectral norm α =240.191
Algebraic connectivity a =0.035 867 4
Spectral separation 1[A] / λ2[A]| =1.221 11
Controllability C =4,540
Relative controllability Cr =0.684 147


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.