Wikipedia links (ku)

This network consists of the wikilinks of the Wikipedia in the Kurdish language (ku). 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_ku
NameWikipedia links (ku)
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 =36,735
Volume m =795,062
Loop count l =78
Wedge count s =108,460,274
Claw count z =40,194,722,059
Cross count x =17,129,863,038,119
Triangle count t =13,057,676
Square count q =1,360,950,032
4-Tour count T4 =11,322,603,392
Maximum degree dmax =3,654
Maximum outdegree d+max =1,417
Maximum indegree dmax =3,626
Average degree d =43.286 3
Fill p =0.000 589 170
Size of LCC N =36,553
Size of LSCC Ns =24,872
Relative size of LSCC Nrs =0.677 065
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.393 88
90-Percentile effective diameter δ0.9 =4.649 86
Median distance δM =4
Mean distance δm =3.892 05
Gini coefficient G =0.747 134
Relative edge distribution entropy Her =0.894 478
Power law exponent γ =1.466 38
Tail power law exponent γt =1.491 00
Degree assortativity ρ =−0.065 764 1
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.693 035
Clustering coefficient c =0.361 174
Directed clustering coefficient c± =0.765 203
Spectral norm α =348.378
Operator 2-norm ν =183.024
Cyclic eigenvalue π =167.260
Algebraic connectivity a =0.107 702
Reciprocity y =0.538 330
Non-bipartivity bA =0.753 329
Normalized non-bipartivity bN =0.057 876 5
Spectral bipartite frustration bK =0.000 846 981


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 ]