Wikipedia links (is)

This network consists of the wikilinks of the Wikipedia in the Icelandic language (is). 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_is
NameWikipedia links (is)
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 =67,653
Volume m =1,128,144
Loop count l =62
Wedge count s =321,539,954
Claw count z =280,304,002,315
Cross count x =201,380,711,253,995
Triangle count t =19,085,749
Square count q =4,971,830,317
4-Tour count T4 =41,062,554,986
Maximum degree dmax =5,512
Maximum outdegree d+max =1,718
Maximum indegree dmax =5,214
Average degree d =33.350 9
Fill p =0.000 246 485
Size of LCC N =67,599
Size of LSCC Ns =48,441
Relative size of LSCC Nrs =0.716 021
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.231 89
90-Percentile effective diameter δ0.9 =4.353 83
Mean distance δm =3.717 19
Gini coefficient G =0.773 561
Relative edge distribution entropy Her =0.865 285
Power law exponent γ =1.493 56
Tail power law exponent γt =2.051 00
Degree assortativity ρ =−0.126 132
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.685 693
Clustering coefficient c =0.178 072
Directed clustering coefficient c± =0.519 701
Spectral norm α =772.628
Operator 2-norm ν =393.065
Cyclic eigenvalue π =379.313
Reciprocity y =0.446 390
Non-bipartivity bA =0.736 120
Normalized non-bipartivity bN =0.021 565 1
Spectral bipartite frustration bK =0.001 124 29


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 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 ]