Wikipedia links (diq)

This network consists of the wikilinks of the Wikipedia in the Zazaki language (diq). 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_diq
NameWikipedia links (diq)
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 =11,676
Volume m =304,575
Loop count l =12
Wedge count s =22,732,428
Claw count z =7,853,892,033
Cross count x =928,269,423,101
Triangle count t =5,578,601
Square count q =695,836,826
4-Tour count T4 =5,658,003,430
Maximum degree dmax =1,375
Maximum outdegree d+max =364
Maximum indegree dmax =1,186
Average degree d =52.171 1
Fill p =0.002 234 12
Size of LCC N =11,570
Size of LSCC Ns =7,284
Relative size of LSCC Nrs =0.623 844
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.340 12
90-Percentile effective diameter δ0.9 =4.812 59
Median distance δM =4
Mean distance δm =3.901 91
Gini coefficient G =0.731 954
Relative edge distribution entropy Her =0.889 878
Power law exponent γ =1.447 89
Tail power law exponent γt =2.701 00
Degree assortativity ρ =+0.279 583
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.795 169
Clustering coefficient c =0.736 208
Directed clustering coefficient c± =0.907 278
Spectral norm α =498.078
Operator 2-norm ν =250.070
Cyclic eigenvalue π =248.011
Algebraic connectivity a =0.041 460 9
Reciprocity y =0.755 243
Non-bipartivity bA =0.915 520
Normalized non-bipartivity bN =0.035 709 7
Spectral bipartite frustration bK =0.000 502 451


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 ]