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,250
Volume m =180,264
Loop count l =20
Wedge count s =26,067,709
Claw count z =10,630,040,358
Cross count x =5,281,940,622,425
Triangle count t =1,530,864
Square count q =145,459,095
4-Tour count T4 =1,268,227,396
Maximum degree dmax =2,699
Maximum outdegree d+max =373
Maximum indegree dmax =2,697
Average degree d =35.173 5
Fill p =0.001 715 78
Size of LCC N =10,154
Size of LSCC Ns =6,501
Relative size of LSCC Nrs =0.634 244
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.116 75
90-Percentile effective diameter δ0.9 =4.457 03
Median distance δM =4
Mean distance δm =3.610 01
Gini coefficient G =0.671 221
Relative edge distribution entropy Her =0.903 285
Power law exponent γ =1.452 59
Tail power law exponent γt =2.481 00
Degree assortativity ρ =−0.103 502
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.674 781
Clustering coefficient c =0.176 179
Directed clustering coefficient c± =0.686 999
Spectral norm α =187.705
Operator 2-norm ν =114.506
Cyclic eigenvalue π =88.337 1
Algebraic connectivity a =0.107 386
Reciprocity y =0.425 531
Non-bipartivity bA =0.468 934
Normalized non-bipartivity bN =0.048 643 0
Spectral bipartite frustration bK =0.000 960 406


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 ]