Wikipedia links (crh)

This network consists of the wikilinks of the Wikipedia in the Crimean Turkish language (crh). 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_crh
NameWikipedia links (crh)
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 =7,945
Volume m =141,800
Loop count l =4
Wedge count s =16,303,112
Claw count z =7,852,749,294
Cross count x =3,337,828,954,526
Triangle count t =1,729,574
Square count q =133,456,276
4-Tour count T4 =1,133,032,226
Maximum degree dmax =2,381
Maximum outdegree d+max =454
Maximum indegree dmax =2,244
Average degree d =35.695 4
Fill p =0.002 246 41
Size of LCC N =5,241
Size of LSCC Ns =3,218
Relative size of LSCC Nrs =0.405 035
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.788 15
90-Percentile effective diameter δ0.9 =4.419 54
Median distance δM =3
Mean distance δm =3.380 68
Gini coefficient G =0.777 655
Relative edge distribution entropy Her =0.858 722
Power law exponent γ =1.665 18
Tail power law exponent γt =2.891 00
Degree assortativity ρ =−0.097 753 0
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.843 232
Clustering coefficient c =0.318 266
Directed clustering coefficient c± =0.828 542
Spectral norm α =260.526
Operator 2-norm ν =130.511
Cyclic eigenvalue π =130.013
Algebraic connectivity a =0.076 714 7
Reciprocity y =0.804 133
Non-bipartivity bA =0.735 352
Normalized non-bipartivity bN =0.041 941 8
Spectral bipartite frustration bK =0.000 599 461


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 ]