Wikipedia links (tr)

This network consists of the wikilinks of the Wikipedia in the Turkish language (tr). 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_tr
NameWikipedia links (tr)
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 =544,514
Volume m =14,703,300
Loop count l =1,735
Wedge count s =14,735,320,220
Claw count z =129,972,147,637,488
Cross count x =1,474,852,639,338,857,728
Triangle count t =221,118,998
Square count q =64,445,412,222
Maximum degree dmax =68,843
Maximum outdegree d+max =2,460
Maximum indegree dmax =67,806
Average degree d =54.005 2
Size of LCC N =533,209
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.322 68
90-Percentile effective diameter δ0.9 =4.508 99
Mean distance δm =3.805 96
Balanced inequality ratio P =0.193 160
Outdegree balanced inequality ratio P+ =0.205 343
Indegree balanced inequality ratio P =0.213 417
Degree assortativity ρ =−0.047 440 4
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.776 691
Clustering coefficient c =0.043 907 2
Operator 2-norm ν =594.791
Cyclic eigenvalue π =393.462
Reciprocity y =0.518 727
Non-bipartivity bA =0.336 919
Normalized non-bipartivity bN =0.048 021 7
Spectral bipartite frustration bK =0.000 520 985


Degree distribution

Cumulative degree distribution

Hop distribution

In/outdegree scatter plot


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 ]