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 failed tests: *** No loop found although #loop is set
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 =2,928
Volume m =118,661
Loop count l =0
Wedge count s =19,251,424
Claw count z =4,479,736,718
Cross count x =678,858,868,021
Triangle count t =2,495,406
Square count q =565,577,422
4-Tour count T4 =4,601,803,642
Maximum degree dmax =1,107
Maximum outdegree d+max =579
Maximum indegree dmax =872
Average degree d =81.052 6
Fill p =0.013 845 7
Size of LCC N =2,911
Size of LSCC Ns =1,657
Relative size of LSCC Nrs =0.565 915
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.611 51
90-Percentile effective diameter δ0.9 =3.838 73
Median distance δM =3
Mean distance δm =3.149 14
Gini coefficient G =0.589 299
Relative edge distribution entropy Her =0.915 204
Power law exponent γ =1.322 95
Tail power law exponent γt =1.781 00
Degree assortativity ρ =−0.188 333
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.535 494
Clustering coefficient c =0.388 866
Directed clustering coefficient c± =0.846 930
Spectral norm α =288.811
Operator 2-norm ν =211.910
Cyclic eigenvalue π =99.001 3
Algebraic connectivity a =0.154 044
Reciprocity y =0.495 125
Non-bipartivity bA =0.521 041
Normalized non-bipartivity bN =0.141 210
Spectral bipartite frustration bK =0.001 085 52


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 ]