Wikipedia links (gd)

This network consists of the wikilinks of the Wikipedia in the Scottish Gaelic language (gd). 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_gd
NameWikipedia links (gd)
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 =22,978
Volume m =340,005
Loop count l =1
Wedge count s =55,618,385
Claw count z =29,747,392,013
Cross count x =16,501,983,838,129
Triangle count t =2,775,845
Square count q =314,601,614
4-Tour count T4 =2,739,792,104
Maximum degree dmax =3,242
Maximum outdegree d+max =549
Maximum indegree dmax =3,239
Average degree d =29.594 0
Fill p =0.000 643 963
Size of LCC N =22,924
Size of LSCC Ns =15,556
Relative size of LSCC Nrs =0.676 995
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.088 55
90-Percentile effective diameter δ0.9 =4.442 05
Median distance δM =4
Mean distance δm =3.630 79
Gini coefficient G =0.734 020
Balanced inequality ratio P =0.211 263
Outdegree balanced inequality ratio P+ =0.232 508
Indegree balanced inequality ratio P =0.200 762
Relative edge distribution entropy Her =0.886 270
Power law exponent γ =1.518 72
Tail power law exponent γt =2.681 00
Tail power law exponent with p γ3 =2.681 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =2.161 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.511 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.112 119
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.149 726
Directed clustering coefficient c± =0.637 456
Spectral norm α =349.548
Operator 2-norm ν =178.488
Cyclic eigenvalue π =171.097
Algebraic connectivity a =0.115 665
Spectral separation 1[A] / λ2[A]| =1.503 16
Reciprocity y =0.512 807
Non-bipartivity bA =0.657 630
Normalized non-bipartivity bN =0.055 711 8
Algebraic non-bipartivity χ =0.108 045
Spectral bipartite frustration bK =0.001 224 71
Controllability C =8,545
Relative controllability Cr =0.371 877


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

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 ]