Wikipedia links (os)

This network consists of the wikilinks of the Wikipedia in the Ossetic language (os). 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_os
NameWikipedia links (os)
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 =20,777
Volume m =264,323
Loop count l =11
Wedge count s =31,371,098
Claw count z =14,346,284,915
Cross count x =5,450,935,621,973
Triangle count t =3,335,510
Square count q =354,512,012
4-Tour count T4 =2,961,937,940
Maximum degree dmax =2,588
Maximum outdegree d+max =357
Maximum indegree dmax =2,575
Average degree d =25.443 8
Fill p =0.000 612 307
Size of LCC N =20,727
Size of LSCC Ns =10,385
Relative size of LSCC Nrs =0.499 832
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.360 18
90-Percentile effective diameter δ0.9 =4.802 68
Median distance δM =4
Mean distance δm =3.891 09
Gini coefficient G =0.796 243
Relative edge distribution entropy Her =0.855 674
Power law exponent γ =1.651 75
Tail power law exponent γt =1.951 00
Degree assortativity ρ =−0.087 395 0
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.799 636
Clustering coefficient c =0.318 973
Directed clustering coefficient c± =0.787 203
Spectral norm α =358.761
Operator 2-norm ν =181.787
Cyclic eigenvalue π =177.134
Algebraic connectivity a =0.141 048
Reciprocity y =0.647 628
Non-bipartivity bA =0.825 342
Normalized non-bipartivity bN =0.105 747
Spectral bipartite frustration bK =0.002 847 80


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

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 ]