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,839
Volume m =332,268
Loop count l =1
Wedge count s =54,246,320
Claw count z =28,956,083,482
Cross count x =15,924,165,191,635
Triangle count t =2,604,187
Square count q =291,062,420
4-Tour count T4 =2,545,978,372
Maximum degree dmax =3,213
Maximum outdegree d+max =511
Maximum indegree dmax =3,210
Average degree d =29.096 5
Fill p =0.000 636 993
Size of LCC N =22,785
Size of LSCC Ns =15,446
Relative size of LSCC Nrs =0.676 299
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.214 64
90-Percentile effective diameter δ0.9 =4.645 49
Median distance δM =4
Mean distance δm =3.748 26
Gini coefficient G =0.734 096
Relative edge distribution entropy Her =0.885 843
Power law exponent γ =1.522 14
Tail power law exponent γt =2.681 00
Degree assortativity ρ =−0.113 258
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.759 417
Clustering coefficient c =0.144 020
Directed clustering coefficient c± =0.635 631
Spectral norm α =347.576
Operator 2-norm ν =175.567
Cyclic eigenvalue π =172.045
Algebraic connectivity a =0.115 664
Reciprocity y =0.514 052
Non-bipartivity bA =0.656 169
Normalized non-bipartivity bN =0.055 711 7
Spectral bipartite frustration bK =0.001 246 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

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 ]