Wikipedia links (glk)

This network consists of the wikilinks of the Wikipedia in the Gilaki language (glk). 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_glk
NameWikipedia links (glk)
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,411
Volume m =343,210
Loop count l =1
Wedge count s =155,753,902
Claw count z =108,616,649,588
Cross count x =68,299,715,429,083
Triangle count t =7,140,609
Square count q =3,025,504,853
4-Tour count T4 =24,827,592,672
Maximum degree dmax =4,767
Maximum outdegree d+max =772
Maximum indegree dmax =4,767
Average degree d =92.621 8
Fill p =0.006 248 94
Size of LCC N =7,340
Size of LSCC Ns =5,912
Relative size of LSCC Nrs =0.797 733
Diameter δ =11
50-Percentile effective diameter δ0.5 =1.996 83
90-Percentile effective diameter δ0.9 =3.616 29
Median distance δM =2
Mean distance δm =2.735 67
Gini coefficient G =0.579 403
Relative edge distribution entropy Her =0.910 126
Power law exponent γ =1.300 56
Tail power law exponent γt =2.221 00
Degree assortativity ρ =−0.302 694
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.562 758
Clustering coefficient c =0.137 536
Directed clustering coefficient c± =0.704 323
Spectral norm α =376.448
Operator 2-norm ν =292.364
Cyclic eigenvalue π =132.005
Algebraic connectivity a =0.062 762 9
Reciprocity y =0.431 744
Non-bipartivity bA =0.436 545
Normalized non-bipartivity bN =0.019 190 9
Spectral bipartite frustration bK =0.000 213 985


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 ]