Wikipedia links (cv)

This network consists of the wikilinks of the Wikipedia in the Chuvash language (cv). 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_cv
NameWikipedia links (cv)
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 =44,634
Volume m =875,818
Loop count l =34
Wedge count s =502,030,832
Claw count z =1,279,490,771,445
Cross count x =3,782,350,035,743,014
Triangle count t =12,880,828
Square count q =2,309,639,427
4-Tour count T4 =19,696,488,620
Maximum degree dmax =14,296
Maximum outdegree d+max =271
Maximum indegree dmax =14,295
Average degree d =39.244 4
Fill p =0.000 439 262
Size of LCC N =44,594
Size of LSCC Ns =23,246
Relative size of LSCC Nrs =0.528 438
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.584 63
90-Percentile effective diameter δ0.9 =3.766 63
Median distance δM =3
Mean distance δm =3.132 83
Gini coefficient G =0.759 760
Balanced inequality ratio P =0.188 951
Outdegree balanced inequality ratio P+ =0.236 582
Indegree balanced inequality ratio P =0.169 420
Relative edge distribution entropy Her =0.873 681
Power law exponent γ =1.438 52
Tail power law exponent γt =1.861 00
Degree assortativity ρ =−0.082 950 3
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.663 576
Clustering coefficient c =0.076 972 3
Directed clustering coefficient c± =0.697 304
Spectral norm α =483.510
Operator 2-norm ν =242.509
Cyclic eigenvalue π =241.001
Algebraic connectivity a =0.110 973
Reciprocity y =0.464 219
Non-bipartivity bA =0.558 885
Normalized non-bipartivity bN =0.095 808 8
Spectral bipartite frustration bK =0.001 397 04


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 ]