Wikipedia links (gv)

This network consists of the wikilinks of the Wikipedia in the Manx language (gv). 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_gv
NameWikipedia links (gv)
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 =6,858
Volume m =150,561
Loop count l =42
Wedge count s =16,807,712
Claw count z =6,750,979,281
Cross count x =3,606,155,830,341
Triangle count t =1,504,310
Square count q =108,942,968
4-Tour count T4 =938,986,062
Maximum degree dmax =2,984
Maximum outdegree d+max =378
Maximum indegree dmax =2,982
Average degree d =43.908 1
Fill p =0.003 201 23
Size of LCC N =6,854
Size of LSCC Ns =4,991
Relative size of LSCC Nrs =0.727 763
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.481 48
90-Percentile effective diameter δ0.9 =3.699 19
Median distance δM =3
Mean distance δm =3.013 64
Gini coefficient G =0.680 407
Relative edge distribution entropy Her =0.901 115
Power law exponent γ =1.419 67
Tail power law exponent γt =2.851 00
Degree assortativity ρ =−0.076 624 6
Degree assortativity p-value pρ =8.919 98 × 10−273
In/outdegree correlation ρ± =+0.758 825
Clustering coefficient c =0.268 504
Directed clustering coefficient c± =0.693 662
Spectral norm α =240.457
Operator 2-norm ν =122.504
Cyclic eigenvalue π =118.067
Algebraic connectivity a =0.267 976
Reciprocity y =0.595 174
Normalized non-bipartivity bN =0.179 420
Spectral bipartite frustration bK =0.002 169 68


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 ]