Wikipedia edits (kj)

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


Internal nameedit-kjwiki
NameWikipedia edits (kj)
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 =160
Left size n1 =47
Right size n2 =113
Volume m =296
Unique edge count m̿ =173
Wedge count s =1,555
Claw count z =15,468
Cross count x =129,049
Square count q =510
4-Tour count T4 =10,674
Maximum degree dmax =66
Maximum left degree d1max =66
Maximum right degree d2max =22
Average degree d =3.700 00
Average left degree d1 =6.297 87
Average right degree d2 =2.619 47
Fill p =0.032 573 9
Average edge multiplicity m̃ =1.710 98
Size of LCC N =91
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.811 18
90-Percentile effective diameter δ0.9 =6.655 81
Median distance δM =4
Mean distance δm =4.335 23
Gini coefficient G =0.563 672
Balanced inequality ratio P =0.285 473
Left balanced inequality ratio P1 =0.206 081
Right balanced inequality ratio P2 =0.344 595
Relative edge distribution entropy Her =0.884 271
Power law exponent γ =3.282 48
Tail power law exponent γt =2.171 00
Tail power law exponent with p γ3 =2.171 00
p-value p =0.194 000
Left tail power law exponent with p γ3,1 =1.921 00
Left p-value p1 =0.607 000
Right tail power law exponent with p γ3,2 =4.681 00
Right p-value p2 =0.036 000 0
Degree assortativity ρ =−0.123 755
Degree assortativity p-value pρ =0.104 765
Spectral norm α =25.495 1
Algebraic connectivity a =0.032 516 1
Spectral separation 1[A] / λ2[A]| =1.876 09
Controllability C =66
Relative controllability Cr =0.423 077


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.