Wikipedia links (ckb)

This network consists of the wikilinks of the Wikipedia in the Central Kurdish language (ckb). 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_ckb
NameWikipedia links (ckb)
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 =60,722
Volume m =1,176,333
Loop count l =44
Wedge count s =217,917,426
Claw count z =113,509,558,198
Cross count x =42,047,591,174,464
Triangle count t =38,728,201
Square count q =7,822,500,281
4-Tour count T4 =56,232,211,478
Maximum degree dmax =3,503
Maximum outdegree d+max =1,145
Maximum indegree dmax =3,412
Average degree d =38.744 9
Fill p =0.000 290 193
Size of LCC N =60,257
Size of LSCC Ns =17,358
Relative size of LSCC Nrs =0.294 154
Diameter δ =13
50-Percentile effective diameter δ0.5 =3.947 85
90-Percentile effective diameter δ0.9 =4.998 81
Median distance δM =4
Mean distance δm =4.424 28
Gini coefficient G =0.868 790
Balanced inequality ratio P =0.126 295
Outdegree balanced inequality ratio P+ =0.125 379
Indegree balanced inequality ratio P =0.212 049
Relative edge distribution entropy Her =0.833 663
Power law exponent γ =1.858 99
Tail power law exponent γt =1.451 00
Degree assortativity ρ =−0.019 491 8
Degree assortativity p-value pρ =8.167 50 × 10−117
In/outdegree correlation ρ± =+0.842 336
Clustering coefficient c =0.533 159
Directed clustering coefficient c± =0.881 432
Spectral norm α =713.503
Operator 2-norm ν =376.349
Cyclic eigenvalue π =337.197
Algebraic connectivity a =0.038 408 9
Reciprocity y =0.625 257
Non-bipartivity bA =0.858 145
Normalized non-bipartivity bN =0.019 215 9
Spectral bipartite frustration bK =0.000 334 076


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

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 ]