Wikipedia edits (kn)

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


Internal nameedit-knwiki
NameWikipedia edits (kn)
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 =99,143
Left size n1 =20,679
Right size n2 =78,464
Volume m =714,594
Unique edge count m̿ =306,084
Wedge count s =466,526,673
Claw count z =1,494,324,391,124
Cross count x =5,259,394,461,185,263
Square count q =456,248,828
4-Tour count T4 =5,516,723,176
Maximum degree dmax =30,106
Maximum left degree d1max =30,106
Maximum right degree d2max =2,093
Average degree d =14.415 4
Average left degree d1 =34.556 5
Average right degree d2 =9.107 28
Fill p =0.000 188 643
Average edge multiplicity m̃ =2.334 63
Size of LCC N =92,336
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.658 50
90-Percentile effective diameter δ0.9 =5.222 87
Median distance δM =4
Mean distance δm =4.233 93
Gini coefficient G =0.825 095
Balanced inequality ratio P =0.162 955
Left balanced inequality ratio P1 =0.101 880
Right balanced inequality ratio P2 =0.197 311
Relative edge distribution entropy Her =0.791 073
Power law exponent γ =2.347 66
Tail power law exponent γt =2.091 00
Degree assortativity ρ =−0.195 996
Degree assortativity p-value pρ =0.000 00
Spectral norm α =2,419.88
Algebraic connectivity a =0.078 988 3


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

Edge weight/multiplicity distribution

Temporal 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.