Wikiquote edits (kn)

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


Internal nameedit-knwikisource
NameWikiquote 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 =28,603
Left size n1 =2,534
Right size n2 =26,069
Volume m =71,811
Unique edge count m̿ =36,394
Wedge count s =71,566,052
Claw count z =222,348,024,194
Cross count x =575,262,334,114,094
Square count q =601,254
4-Tour count T4 =291,149,148
Maximum degree dmax =20,828
Maximum left degree d1max =20,828
Maximum right degree d2max =2,121
Average degree d =5.021 22
Average left degree d1 =28.339 0
Average right degree d2 =2.754 65
Fill p =0.000 550 933
Average edge multiplicity m̃ =1.973 15
Size of LCC N =26,862
Diameter δ =15
50-Percentile effective diameter δ0.5 =3.937 60
90-Percentile effective diameter δ0.9 =6.853 64
Median distance δM =4
Mean distance δm =4.619 41
Gini coefficient G =0.714 533
Balanced inequality ratio P =0.218 692
Left balanced inequality ratio P1 =0.142 889
Right balanced inequality ratio P2 =0.331 133
Relative edge distribution entropy Her =0.754 652
Power law exponent γ =5.059 46
Tail power law exponent γt =2.631 00
Tail power law exponent with p γ3 =2.631 00
p-value p =0.000 00
Left tail power law exponent with p γ3,1 =1.651 00
Left p-value p1 =0.020 000 0
Right tail power law exponent with p γ3,2 =2.911 00
Right p-value p2 =0.000 00
Degree assortativity ρ =−0.231 313
Degree assortativity p-value pρ =0.000 00
Spectral norm α =908.478
Algebraic connectivity a =0.000 448 992
Spectral separation 1[A] / λ2[A]| =1.611 34
Controllability C =25,222
Relative controllability Cr =0.895 763


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.