Wikipedia links (kv)

This network consists of the wikilinks of the Wikipedia in the Komi language (kv). 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_kv
NameWikipedia links (kv)
Data source
AvailabilityDataset is available for download
Consistency checkDataset failed tests: *** No loop found although #loop is set
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 =6,902
Volume m =209,074
Loop count l =0
Wedge count s =24,653,470
Claw count z =10,414,444,558
Cross count x =1,614,576,256,046
Triangle count t =4,433,113
Square count q =715,175,493
4-Tour count T4 =5,820,285,512
Maximum degree dmax =1,366
Maximum outdegree d+max =488
Maximum indegree dmax =1,301
Average degree d =60.583 6
Fill p =0.004 389 48
Size of LCC N =6,878
Size of LSCC Ns =4,336
Relative size of LSCC Nrs =0.628 224
Diameter δ =68
50-Percentile effective diameter δ0.5 =3.019 92
90-Percentile effective diameter δ0.9 =4.699 71
Median distance δM =4
Mean distance δm =4.375 16
Gini coefficient G =0.750 940
Relative edge distribution entropy Her =0.871 738
Power law exponent γ =1.413 23
Tail power law exponent γt =2.151 00
Degree assortativity ρ =−0.134 426
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.752 886
Clustering coefficient c =0.539 451
Directed clustering coefficient c± =0.897 085
Spectral norm α =506.842
Operator 2-norm ν =253.771
Cyclic eigenvalue π =253.072
Algebraic connectivity a =0.001 919 16
Reciprocity y =0.719 650
Non-bipartivity bA =0.813 068
Normalized non-bipartivity bN =0.031 120 2
Spectral bipartite frustration bK =0.000 362 616


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

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 ]