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,810
Volume m =310,697
Loop count l =12
Wedge count s =23,705,171
Claw count z =8,209,252,970
Cross count x =997,880,843,222
Triangle count t =5,687,895
Square count q =705,617,430
4-Tour count T4 =5,740,146,580
Maximum degree dmax =1,447
Maximum outdegree d+max =414
Maximum indegree dmax =1,256
Average degree d =52.615 9
Fill p =0.002 227 60
Size of LCC N =11,708
Size of LSCC Ns =7,324
Relative size of LSCC Nrs =0.620 152
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.437 71
90-Percentile effective diameter δ0.9 =4.950 93
Median distance δM =4
Mean distance δm =4.011 43
Gini coefficient G =0.733 333
Balanced inequality ratio P =0.212 807
Outdegree balanced inequality ratio P+ =0.208 287
Indegree balanced inequality ratio P =0.248 660
Relative edge distribution entropy Her =0.889 365
Power law exponent γ =1.450 87
Tail power law exponent γt =1.361 00
Degree assortativity ρ =+0.218 610
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.801 670
Clustering coefficient c =0.719 830
Directed clustering coefficient c± =0.899 977
Spectral norm α =498.079
Operator 2-norm ν =250.070
Spectral separation 1[A] / λ2[A]| =1.926 61
Reciprocity y =0.756 126
Non-bipartivity bA =0.892 740
Algebraic non-bipartivity χ =0.065 837 5
Spectral bipartite frustration bK =0.000 498 772
Controllability C =4,265
Relative controllability Cr =0.361 135


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 ]