Wikipedia links (ga)

This network consists of the wikilinks of the Wikipedia in the Irish language (ga). 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_ga
NameWikipedia links (ga)
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 =55,088
Volume m =1,611,606
Loop count l =36
Wedge count s =1,423,017,598
Claw count z =10,408,939,643,316
Cross count x =79,892,283,648,761,760
Triangle count t =68,078,381
Square count q =29,035,376,699
4-Tour count T4 =235,587,102,986
Maximum degree dmax =34,150
Maximum outdegree d+max =2,707
Maximum indegree dmax =34,149
Average degree d =58.510 2
Fill p =0.000 561 705
Size of LCC N =55,066
Size of LSCC Ns =39,137
Relative size of LSCC Nrs =0.748 575
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.250 31
90-Percentile effective diameter δ0.9 =3.477 58
Median distance δM =3
Mean distance δm =2.804 51
Gini coefficient G =0.801 543
Balanced inequality ratio P =0.164 165
Outdegree balanced inequality ratio P+ =0.184 121
Indegree balanced inequality ratio P =0.146 130
Relative edge distribution entropy Her =0.859 216
Power law exponent γ =1.415 55
Tail power law exponent γt =1.711 00
Degree assortativity ρ =−0.053 104 7
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.646 248
Clustering coefficient c =0.143 523
Directed clustering coefficient c± =0.849 922
Spectral norm α =871.027
Operator 2-norm ν =558.845
Cyclic eigenvalue π =313.197
Algebraic connectivity a =0.195 411
Reciprocity y =0.540 537
Non-bipartivity bA =0.708 498
Normalized non-bipartivity bN =0.131 511
Spectral bipartite frustration bK =0.001 144 79


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 ]