Wikipedia links (lez)

This network consists of the wikilinks of the Wikipedia in the Lezghian language (lez). 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_lez
NameWikipedia links (lez)
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 =5,057
Volume m =195,968
Loop count l =13
Wedge count s =22,862,312
Claw count z =7,178,625,869
Cross count x =1,578,637,445,624
Triangle count t =3,423,328
Square count q =340,873,579
4-Tour count T4 =2,818,688,264
Maximum degree dmax =1,665
Maximum outdegree d+max =418
Maximum indegree dmax =1,429
Average degree d =77.503 7
Fill p =0.007 663 01
Size of LCC N =5,037
Size of LSCC Ns =3,781
Relative size of LSCC Nrs =0.747 676
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.688 83
90-Percentile effective diameter δ0.9 =3.953 39
Median distance δM =3
Mean distance δm =3.238 49
Gini coefficient G =0.659 270
Relative edge distribution entropy Her =0.905 122
Power law exponent γ =1.370 43
Tail power law exponent γt =2.601 00
Degree assortativity ρ =−0.104 113
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.839 999
Clustering coefficient c =0.449 210
Directed clustering coefficient c± =0.804 904
Spectral norm α =324.296
Operator 2-norm ν =165.847
Cyclic eigenvalue π =159.064
Algebraic connectivity a =0.150 362
Reciprocity y =0.722 256
Non-bipartivity bA =0.776 965
Normalized non-bipartivity bN =0.096 450 2
Spectral bipartite frustration bK =0.000 760 276


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 ]