Wikipedia links (nap)

This network consists of the wikilinks of the Wikipedia in the Neapolitan language (nap). 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_nap
NameWikipedia links (nap)
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 =15,405
Volume m =994,869
Loop count l =9
Wedge count s =224,887,641
Claw count z =421,914,764,670
Cross count x =798,116,000,761,453
Triangle count t =27,171,698
Square count q =4,323,867,658
4-Tour count T4 =35,491,614,310
Maximum degree dmax =8,619
Maximum outdegree d+max =682
Maximum indegree dmax =8,540
Average degree d =129.162
Fill p =0.004 192 20
Size of LCC N =15,377
Size of LSCC Ns =12,446
Relative size of LSCC Nrs =0.807 920
Diameter δ =35
50-Percentile effective diameter δ0.5 =2.830 69
90-Percentile effective diameter δ0.9 =5.781 91
Mean distance δm =3.772 27
Gini coefficient G =0.603 571
Relative edge distribution entropy Her =0.930 977
Power law exponent γ =1.294 81
Tail power law exponent γt =2.311 00
Degree assortativity ρ =−0.037 915 4
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.807 854
Clustering coefficient c =0.362 470
Directed clustering coefficient c± =0.973 374
Spectral norm α =624.356
Operator 2-norm ν =316.392
Cyclic eigenvalue π =309.006
Algebraic connectivity a =0.011 600 1
Reciprocity y =0.871 720
Non-bipartivity bA =0.810 185
Normalized non-bipartivity bN =0.049 778 1
Spectral bipartite frustration bK =0.000 305 549


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 ]