Wikipedia links (new)

This network consists of the wikilinks of the Wikipedia in the Newari language (new). 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_new
NameWikipedia links (new)
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 =100,554
Volume m =1,808,581
Loop count l =12
Wedge count s =3,525,749,005
Claw count z =16,034,943,816,451
Cross count x =77,691,644,548,470,928
Triangle count t =35,721,462
Square count q =35,259,896,762
4-Tour count T4 =296,185,260,860
Maximum degree dmax =31,833
Maximum outdegree d+max =3,764
Maximum indegree dmax =31,735
Average degree d =35.972 3
Fill p =0.000 178 871
Size of LCC N =100,295
Size of LSCC Ns =40,908
Relative size of LSCC Nrs =0.406 826
Diameter δ =14
50-Percentile effective diameter δ0.5 =3.043 61
90-Percentile effective diameter δ0.9 =4.728 97
Mean distance δm =3.658 95
Gini coefficient G =0.816 885
Relative edge distribution entropy Her =0.822 320
Power law exponent γ =1.522 33
Tail power law exponent γt =2.091 00
Degree assortativity ρ =−0.197 731
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.388 293
Clustering coefficient c =0.030 394 8
Directed clustering coefficient c± =0.703 529
Spectral norm α =751.404
Operator 2-norm ν =513.736
Cyclic eigenvalue π =374.003
Algebraic connectivity a =0.017 561 2
Reciprocity y =0.291 060
Non-bipartivity bA =0.333 550
Normalized non-bipartivity bN =0.003 264 43
Spectral bipartite frustration bK =0.000 373 947
Controllability C =71,001
Relative controllability Cr =0.706 098


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 ]