Wikipedia links (sah)

This network consists of the wikilinks of the Wikipedia in the Sakha language (sah). 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_sah
NameWikipedia links (sah)
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 =15,266
Volume m =351,305
Loop count l =201
Wedge count s =49,954,944
Claw count z =34,529,780,616
Cross count x =6,269,403,734,755
Triangle count t =12,482,808
Square count q =3,101,041,070
4-Tour count T4 =25,008,602,900
Maximum degree dmax =1,468
Maximum outdegree d+max =462
Maximum indegree dmax =1,459
Average degree d =46.024 5
Fill p =0.001 507 42
Size of LCC N =15,107
Size of LSCC Ns =9,118
Relative size of LSCC Nrs =0.597 275
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.312 81
90-Percentile effective diameter δ0.9 =4.613 82
Median distance δM =4
Mean distance δm =3.821 14
Gini coefficient G =0.821 815
Relative edge distribution entropy Her =0.831 855
Power law exponent γ =1.489 39
Tail power law exponent γt =1.901 00
Degree assortativity ρ =+0.376 292
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.684 553
Clustering coefficient c =0.749 644
Directed clustering coefficient c± =0.927 968
Spectral norm α =739.915
Operator 2-norm ν =373.646
Cyclic eigenvalue π =366.083
Algebraic connectivity a =0.088 119 7
Reciprocity y =0.705 498
Non-bipartivity bA =0.914 088
Normalized non-bipartivity bN =0.053 967 7
Spectral bipartite frustration bK =0.000 766 905


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 ]