Wikipedia links (qu)

This network consists of the wikilinks of the Wikipedia in the Quechua language (qu). 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_qu
NameWikipedia links (qu)
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 =37,038
Volume m =1,162,814
Loop count l =9
Wedge count s =603,776,697
Claw count z =644,656,954,030
Cross count x =771,745,566,996,357
Triangle count t =48,881,756
Square count q =15,706,397,658
4-Tour count T4 =128,068,282,374
Maximum degree dmax =7,797
Maximum outdegree d+max =2,663
Maximum indegree dmax =7,752
Average degree d =62.790 3
Fill p =0.000 847 647
Size of LCC N =36,966
Size of LSCC Ns =21,043
Relative size of LSCC Nrs =0.568 146
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.005 86
90-Percentile effective diameter δ0.9 =4.191 95
Mean distance δm =3.510 97
Gini coefficient G =0.803 690
Relative edge distribution entropy Her =0.863 380
Power law exponent γ =1.461 77
Tail power law exponent γt =1.631 00
Degree assortativity ρ =−0.127 337
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.582 578
Clustering coefficient c =0.242 880
Directed clustering coefficient c± =0.788 402
Spectral norm α =701.449
Operator 2-norm ν =376.456
Cyclic eigenvalue π =336.045
Algebraic connectivity a =0.064 672 3
Reciprocity y =0.284 910
Non-bipartivity bA =0.589 649
Normalized non-bipartivity bN =0.035 680 6
Spectral bipartite frustration bK =0.000 293 636


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

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 ]