Wikipedia links (kn)

This network consists of the wikilinks of the Wikipedia in the Kannada language (kn). Nodes are Wikipedia articles, and directed edges are wikilinks, i.e., hyperlinks within one wiki. In the wiki source, these are indicated with [[double brackets]]. Only pages in the article namespace are included.


Internal namewikipedia_link_kn
NameWikipedia links (kn)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops


Size n =28,174
Volume m =301,823
Loop count l =12
Wedge count s =50,476,232
Claw count z =22,141,294,765
Cross count x =12,566,615,190,812
Triangle count t =1,692,869
Square count q =281,808,205
4-Tour count T4 =2,456,904,944
Maximum degree dmax =3,500
Maximum outdegree d+max =977
Maximum indegree dmax =3,383
Average degree d =21.425 6
Fill p =0.000 380 238
Size of LCC N =27,958
Size of LSCC Ns =16,416
Relative size of LSCC Nrs =0.582 665
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.246 80
90-Percentile effective diameter δ0.9 =4.471 17
Median distance δM =4
Mean distance δm =3.748 99
Gini coefficient G =0.721 824
Relative edge distribution entropy Her =0.887 796
Power law exponent γ =1.531 00
Tail power law exponent γt =2.741 00
Degree assortativity ρ =−0.106 406
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.457 827
Clustering coefficient c =0.100 614
Directed clustering coefficient c± =0.333 529
Spectral norm α =205.422
Operator 2-norm ν =154.147
Cyclic eigenvalue π =87.992 3
Algebraic connectivity a =0.079 776 8
Reciprocity y =0.229 466
Non-bipartivity bA =0.225 748
Normalized non-bipartivity bN =0.046 968 0
Spectral bipartite frustration bK =0.001 043 71


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

Delaunay graph drawing

In/outdegree scatter plot

Clustering coefficient distribution

Average neighbor degree distribution


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 ]