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,110
Volume m =175,911
Loop count l =8
Wedge count s =24,645,451
Claw count z =12,534,026,432
Cross count x =3,517,487,406,329
Triangle count t =4,201,337
Square count q =743,618,388
4-Tour count T4 =6,047,748,998
Maximum degree dmax =2,118
Maximum outdegree d+max =322
Maximum indegree dmax =2,112
Average degree d =49.482 7
Fill p =0.003 479 80
Size of LCC N =7,097
Size of LSCC Ns =5,046
Relative size of LSCC Nrs =0.709 705
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.797 04
90-Percentile effective diameter δ0.9 =3.937 03
Median distance δM =3
Mean distance δm =3.325 43
Gini coefficient G =0.745 738
Relative edge distribution entropy Her =0.863 807
Power law exponent γ =1.429 37
Tail power law exponent γt =2.141 00
Degree assortativity ρ =−0.109 652
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.800 116
Clustering coefficient c =0.511 413
Directed clustering coefficient c± =0.878 962
Spectral norm α =500.997
Operator 2-norm ν =257.834
Cyclic eigenvalue π =243.149
Algebraic connectivity a =0.167 242
Reciprocity y =0.748 810
Non-bipartivity bA =0.857 070
Normalized non-bipartivity bN =0.102 014
Spectral bipartite frustration bK =0.001 345 66


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 ]