Wikibooks edits (kn)

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


Internal nameedit-knwikibooks
NameWikibooks 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 =204
Left size n1 =47
Right size n2 =157
Volume m =278
Unique edge count m̿ =190
Wedge count s =1,692
Claw count z =18,447
Cross count x =176,632
Square count q =191
4-Tour count T4 =8,740
Maximum degree dmax =57
Maximum left degree d1max =57
Maximum right degree d2max =43
Average degree d =2.725 49
Average left degree d1 =5.914 89
Average right degree d2 =1.770 70
Fill p =0.025 748 7
Average edge multiplicity m̃ =1.463 16
Size of LCC N =50
Diameter δ =4
50-Percentile effective diameter δ0.5 =1.522 16
90-Percentile effective diameter δ0.9 =1.992 71
Median distance δM =2
Mean distance δm =2.093 81
Gini coefficient G =0.595 473
Balanced inequality ratio P =0.278 777
Left balanced inequality ratio P1 =0.219 424
Right balanced inequality ratio P2 =0.359 712
Relative edge distribution entropy Her =0.880 767
Power law exponent γ =4.725 11
Tail power law exponent γt =2.561 00
Tail power law exponent with p γ3 =2.561 00
p-value p =0.031 000 0
Left tail power law exponent with p γ3,1 =1.851 00
Left p-value p1 =0.015 000 0
Right tail power law exponent with p γ3,2 =3.221 00
Right p-value p2 =0.007 000 00
Degree assortativity ρ =−0.195 409
Degree assortativity p-value pρ =0.006 895 42
Spectral norm α =43.231 9
Spectral separation 1[A] / λ2[A]| =4.288 88
Controllability C =112
Relative controllability Cr =0.549 020


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