Wikipedia links (so)

This network consists of the wikilinks of the Wikipedia in the Somali language (so). 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_so
NameWikipedia links (so)
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,912
Volume m =126,686
Loop count l =14
Wedge count s =12,436,647
Claw count z =3,308,807,909
Cross count x =628,782,122,846
Triangle count t =1,882,314
Square count q =206,443,016
4-Tour count T4 =1,701,484,972
Maximum degree dmax =1,622
Maximum outdegree d+max =385
Maximum indegree dmax =1,611
Average degree d =32.023 8
Fill p =0.002 023 75
Size of LCC N =7,841
Size of LSCC Ns =5,655
Relative size of LSCC Nrs =0.714 737
Diameter δ =55
50-Percentile effective diameter δ0.5 =2.920 90
90-Percentile effective diameter δ0.9 =4.287 72
Median distance δM =3
Mean distance δm =3.786 79
Gini coefficient G =0.748 779
Relative edge distribution entropy Her =0.871 295
Power law exponent γ =1.495 79
Tail power law exponent γt =2.431 00
Degree assortativity ρ =−0.047 622 1
Degree assortativity p-value pρ =6.427 87 × 10−98
In/outdegree correlation ρ± =+0.557 798
Clustering coefficient c =0.454 057
Directed clustering coefficient c± =0.797 130
Spectral norm α =353.451
Operator 2-norm ν =181.865
Cyclic eigenvalue π =171.495
Algebraic connectivity a =0.004 947 29
Reciprocity y =0.466 524
Non-bipartivity bA =0.868 118
Normalized non-bipartivity bN =0.001 330 02
Spectral bipartite frustration bK =2.686 08 × 10−5


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 ]