Wikipedia links (gag)

This network consists of the wikilinks of the Wikipedia in the Gagauz language (gag). 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_gag
NameWikipedia links (gag)
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
LoopsDoes not contain loops


Size n =2,929
Volume m =118,603
Loop count l =0
Wedge count s =19,207,308
Claw count z =4,463,953,915
Cross count x =675,400,388,289
Triangle count t =2,492,439
Square count q =563,799,811
4-Tour count T4 =4,587,406,178
Maximum degree dmax =1,107
Maximum outdegree d+max =579
Maximum indegree dmax =872
Average degree d =80.985 3
Fill p =0.013 829 5
Size of LCC N =2,912
Size of LSCC Ns =1,658
Relative size of LSCC Nrs =0.566 064
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.571 98
90-Percentile effective diameter δ0.9 =3.784 44
Median distance δM =3
Mean distance δm =3.103 45
Gini coefficient G =0.589 489
Balanced inequality ratio P =0.293 091
Outdegree balanced inequality ratio P+ =0.313 668
Indegree balanced inequality ratio P =0.231 714
Relative edge distribution entropy Her =0.915 188
Power law exponent γ =1.323 05
Tail power law exponent γt =1.781 00
In/outdegree correlation ρ± =+0.535 959
Clustering coefficient c =0.389 295
Directed clustering coefficient c± =0.846 645
Operator 2-norm ν =211.724
Cyclic eigenvalue π =99.001 3
Algebraic connectivity a =0.154 044
Reciprocity y =0.495 333
Non-bipartivity bA =0.521 379
Normalized non-bipartivity bN =0.141 438
Algebraic non-bipartivity χ =0.266 318
Spectral bipartite frustration bK =0.001 086 57
Controllability C =1,194
Relative controllability Cr =0.407 648


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 ]