Wikipedia links (roa-tara)

This network consists of the wikilinks of the Wikipedia in the Tarantino language (roa-tara). 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_roa_tara
NameWikipedia links (roa-tara)
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 =10,403
Volume m =1,089,690
Loop count l =37
Wedge count s =309,605,089
Claw count z =599,650,750,199
Cross count x =1,128,882,058,904,149
Triangle count t =32,938,364
Square count q =5,589,016,705
4-Tour count T4 =45,951,780,980
Maximum degree dmax =8,528
Maximum outdegree d+max =449
Maximum indegree dmax =8,443
Average degree d =209.495
Fill p =0.010 069 0
Size of LCC N =10,392
Size of LSCC Ns =9,246
Relative size of LSCC Nrs =0.888 782
Diameter δ =10
50-Percentile effective diameter δ0.5 =1.694 13
90-Percentile effective diameter δ0.9 =2.749 31
Mean distance δm =2.319 95
Gini coefficient G =0.454 612
Relative edge distribution entropy Her =0.957 624
Power law exponent γ =1.238 05
Tail power law exponent γt =2.211 00
Degree assortativity ρ =−0.053 892 7
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.735 334
Clustering coefficient c =0.319 165
Directed clustering coefficient c± =0.945 107
Spectral norm α =625.466
Operator 2-norm ν =319.976
Cyclic eigenvalue π =309.020
Algebraic connectivity a =0.158 810
Reciprocity y =0.873 972
Non-bipartivity bA =0.761 028
Normalized non-bipartivity bN =0.116 968
Spectral bipartite frustration bK =0.000 404 620


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 ]