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,439
Volume m =125,060
Loop count l =14
Wedge count s =12,415,931
Claw count z =3,311,775,308
Cross count x =627,538,675,810
Triangle count t =1,877,744
Square count q =206,190,939
4-Tour count T4 =1,699,383,424
Maximum degree dmax =1,610
Maximum outdegree d+max =385
Maximum indegree dmax =1,599
Average degree d =33.622 8
Fill p =0.002 259 90
Size of LCC N =7,366
Size of LSCC Ns =5,149
Relative size of LSCC Nrs =0.692 163
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.805 26
90-Percentile effective diameter δ0.9 =3.915 89
Median distance δM =3
Mean distance δm =3.357 57
Gini coefficient G =0.745 469
Balanced inequality ratio P =0.202 667
Outdegree balanced inequality ratio P+ =0.184 144
Indegree balanced inequality ratio P =0.208 252
Relative edge distribution entropy Her =0.872 856
Power law exponent γ =1.479 62
Tail power law exponent γt =2.431 00
Degree assortativity ρ =−0.051 526 0
Degree assortativity p-value pρ =4.003 98 × 10−113
In/outdegree correlation ρ± =+0.555 984
Clustering coefficient c =0.453 710
Directed clustering coefficient c± =0.795 582
Spectral norm α =353.451
Operator 2-norm ν =181.865
Reciprocity y =0.463 122
Controllability C =2,750
Relative controllability Cr =0.369 673


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 ]