Wikipedia links (tk)

This network consists of the wikilinks of the Wikipedia in the Turkmen language (tk). 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_tk
NameWikipedia links (tk)
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 =5,989
Volume m =166,918
Loop count l =0
Wedge count s =28,576,406
Claw count z =30,420,684,953
Cross count x =21,950,771,186,754
Triangle count t =3,423,640
Square count q =583,659,413
4-Tour count T4 =4,783,795,038
Maximum degree dmax =4,314
Maximum outdegree d+max =2,100
Maximum indegree dmax =2,450
Average degree d =55.741 5
Fill p =0.004 654 44
Size of LCC N =5,776
Size of LSCC Ns =4,296
Relative size of LSCC Nrs =0.717 315
Diameter δ =12
50-Percentile effective diameter δ0.5 =2.921 05
90-Percentile effective diameter δ0.9 =4.573 59
Median distance δM =3
Mean distance δm =3.479 93
Gini coefficient G =0.695 509
Relative edge distribution entropy Her =0.875 503
Power law exponent γ =1.393 08
Tail power law exponent γt =2.051 00
Degree assortativity ρ =−0.139 836
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.794 677
Clustering coefficient c =0.359 420
Directed clustering coefficient c± =0.754 829
Spectral norm α =506.503
Operator 2-norm ν =253.503
Cyclic eigenvalue π =253.000
Algebraic connectivity a =0.054 485 0
Reciprocity y =0.717 274
Non-bipartivity bA =0.743 681
Normalized non-bipartivity bN =0.049 848 7
Spectral bipartite frustration bK =0.000 584 063


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 ]