Wikipedia edits (kg)

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


Internal nameedit-kgwiki
NameWikipedia edits (kg)
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 =3,384
Left size n1 =654
Right size n2 =2,730
Volume m =35,497
Unique edge count m̿ =15,402
Wedge count s =2,212,031
Claw count z =288,078,642
Cross count x =35,089,149,348
Square count q =7,985,384
4-Tour count T4 =72,782,676
Maximum degree dmax =2,853
Maximum left degree d1max =2,853
Maximum right degree d2max =211
Average degree d =20.979 3
Average left degree d1 =54.276 8
Average right degree d2 =13.002 6
Fill p =0.008 626 54
Average edge multiplicity m̃ =2.304 70
Size of LCC N =2,794
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.608 05
90-Percentile effective diameter δ0.9 =5.666 48
Median distance δM =4
Mean distance δm =4.233 30
Gini coefficient G =0.850 227
Balanced inequality ratio P =0.145 181
Left balanced inequality ratio P1 =0.089 078 0
Right balanced inequality ratio P2 =0.182 551
Relative edge distribution entropy Her =0.802 858
Power law exponent γ =2.096 95
Tail power law exponent γt =2.251 00
Tail power law exponent with p γ3 =2.251 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.631 00
Left p-value p1 =0.000 00
Right tail power law exponent with p γ3,2 =7.651 00
Right p-value p2 =0.074 000 0
Degree assortativity ρ =−0.081 510 3
Degree assortativity p-value pρ =3.989 91 × 10−24
Spectral norm α =344.041
Algebraic connectivity a =0.024 299 8
Spectral separation 1[A] / λ2[A]| =2.765 09
Controllability C =2,087
Relative controllability Cr =0.633 000


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.