Wikipedia links (ru)

This network consists of the wikilinks of the Wikipedia in the Russian language (ru). 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_ru
NameWikipedia links (ru)
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 =3,370,462
Volume m =93,373,056
Loop count l =23,397
Wedge count s =365,692,495,727
Claw count z =15,234,570,482,863,242
Cross count x =7.487 85 × 1020
Triangle count t =1,977,659,897
Maximum degree dmax =283,929
Maximum outdegree d+max =5,333
Maximum indegree dmax =281,486
Average degree d =55.406 7
Fill p =1.008 03 × 10−5
Size of LCC N =3,370,272
Size of LSCC Ns =1,817,233
Relative size of LSCC Nrs =0.636 929
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.482 10
90-Percentile effective diameter δ0.9 =4.588 81
Median distance δM =4
Mean distance δm =3.963 86
Gini coefficient G =0.769 557
Balanced inequality ratio P =0.174 705
Outdegree balanced inequality ratio P+ =0.189 155
Indegree balanced inequality ratio P =0.178 539
Relative edge distribution entropy Her =0.887 035
Power law exponent γ =1.502 15
Tail power law exponent γt =2.271 00
Degree assortativity ρ =−0.038 100 6
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.016 224 0
Directed clustering coefficient c± =0.390 773
Spectral norm α =1,641.65
Operator 2-norm ν =1,212.83
Reciprocity y =0.458 600
Non-bipartivity bA =0.264 277
Normalized non-bipartivity bN =0.012 519 1


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

Hop distribution

In/outdegree scatter plot

Edge weight/multiplicity 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 ]