Wikipedia links (rue)

This network consists of the wikilinks of the Wikipedia in the Rusyn language (rue). 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_rue
NameWikipedia links (rue)
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 =7,621
Volume m =178,842
Loop count l =8
Wedge count s =24,718,639
Claw count z =12,452,641,050
Cross count x =3,550,724,102,258
Triangle count t =4,099,949
Square count q =714,313,210
4-Tour count T4 =5,813,606,596
Maximum degree dmax =2,128
Maximum outdegree d+max =321
Maximum indegree dmax =2,122
Average degree d =46.934 0
Fill p =0.003 079 25
Size of LCC N =7,610
Size of LSCC Ns =5,443
Relative size of LSCC Nrs =0.714 211
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.955 03
90-Percentile effective diameter δ0.9 =4.382 38
Median distance δM =3
Mean distance δm =3.503 83
Gini coefficient G =0.745 838
Balanced inequality ratio P =0.192 617
Outdegree balanced inequality ratio P+ =0.210 806
Indegree balanced inequality ratio P =0.189 212
Relative edge distribution entropy Her =0.864 208
Power law exponent γ =1.434 61
Tail power law exponent γt =2.161 00
Degree assortativity ρ =−0.105 109
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.787 085
Clustering coefficient c =0.497 594
Directed clustering coefficient c± =0.874 908
Spectral norm α =496.416
Operator 2-norm ν =255.324
Cyclic eigenvalue π =241.066
Algebraic connectivity a =0.156 470
Reciprocity y =0.734 257
Algebraic non-bipartivity χ =0.154 463
Controllability C =2,141
Relative controllability Cr =0.280 934


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 ]