Wikipedia links (nah)

This network consists of the wikilinks of the Wikipedia in the Nāhuatl language (nah). 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_nah
NameWikipedia links (nah)
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,285
Volume m =180,916
Loop count l =20
Wedge count s =26,218,044
Claw count z =10,640,390,438
Cross count x =5,280,190,124,151
Triangle count t =1,529,860
Square count q =145,807,606
4-Tour count T4 =1,271,618,446
Maximum degree dmax =2,698
Maximum outdegree d+max =372
Maximum indegree dmax =2,696
Average degree d =35.180 6
Fill p =0.001 710 28
Size of LCC N =10,160
Size of LSCC Ns =6,504
Relative size of LSCC Nrs =0.632 377
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.106 67
90-Percentile effective diameter δ0.9 =4.427 55
Median distance δM =4
Mean distance δm =3.604 91
Gini coefficient G =0.673 232
Balanced inequality ratio P =0.254 574
Outdegree balanced inequality ratio P+ =0.256 069
Indegree balanced inequality ratio P =0.260 259
Relative edge distribution entropy Her =0.902 760
Power law exponent γ =1.453 96
Tail power law exponent γt =2.541 00
In/outdegree correlation ρ± =+0.676 463
Clustering coefficient c =0.175 054
Directed clustering coefficient c± =0.679 270
Spectral norm α =187.712
Operator 2-norm ν =114.739
Cyclic eigenvalue π =88.337 3
Algebraic connectivity a =0.084 254 6
Reciprocity y =0.422 240
Non-bipartivity bA =0.467 966
Algebraic non-bipartivity χ =0.084 319 2
Spectral bipartite frustration bK =0.000 750 628
Controllability C =3,539
Relative controllability Cr =0.344 093


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 ]