Wikipedia links (fo)

This network consists of the wikilinks of the Wikipedia in the Faroese language (fo). 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_fo
NameWikipedia links (fo)
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 =17,537
Volume m =294,812
Loop count l =26
Wedge count s =40,164,417
Claw count z =19,222,592,477
Cross count x =7,792,270,498,435
Triangle count t =3,805,070
Square count q =583,957,925
4-Tour count T4 =4,832,752,742
Maximum degree dmax =2,886
Maximum outdegree d+max =594
Maximum indegree dmax =2,812
Average degree d =33.621 7
Fill p =0.000 958 594
Size of LCC N =17,519
Size of LSCC Ns =12,659
Relative size of LSCC Nrs =0.721 845
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.941 32
90-Percentile effective diameter δ0.9 =4.050 84
Median distance δM =3
Mean distance δm =3.499 84
Gini coefficient G =0.737 592
Relative edge distribution entropy Her =0.878 454
Power law exponent γ =1.480 27
Tail power law exponent γt =2.141 00
Degree assortativity ρ =−0.091 258 7
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.774 235
Clustering coefficient c =0.284 212
Directed clustering coefficient c± =0.684 743
Spectral norm α =496.528
Operator 2-norm ν =249.513
Cyclic eigenvalue π =247.008
Algebraic connectivity a =0.131 424
Reciprocity y =0.535 677
Non-bipartivity bA =0.824 313
Normalized non-bipartivity bN =0.080 340 0
Spectral bipartite frustration bK =0.001 324 32


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 ]