Wikipedia links (sw)

This network consists of the wikilinks of the Wikipedia in the Swahili language (sw). 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_sw
NameWikipedia links (sw)
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 =58,770
Volume m =1,077,184
Loop count l =22
Wedge count s =306,396,909
Claw count z =284,429,817,451
Cross count x =346,700,900,068,590
Triangle count t =16,151,476
Square count q =4,272,189,101
4-Tour count T4 =35,009,803,936
Maximum degree dmax =7,607
Maximum outdegree d+max =2,101
Maximum indegree dmax =6,966
Average degree d =36.657 6
Fill p =0.000 329 291
Size of LCC N =58,758
Size of LSCC Ns =41,061
Relative size of LSCC Nrs =0.736 586
Diameter δ =8
50-Percentile effective diameter δ0.5 =3.064 02
90-Percentile effective diameter δ0.9 =4.129 59
Median distance δM =4
Mean distance δm =3.589 65
Gini coefficient G =0.744 036
Balanced inequality ratio P =0.206 637
Outdegree balanced inequality ratio P+ =0.222 435
Indegree balanced inequality ratio P =0.187 300
Relative edge distribution entropy Her =0.888 545
Power law exponent γ =1.471 36
Tail power law exponent γt =2.111 00
Degree assortativity ρ =−0.111 361
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.699 759
Clustering coefficient c =0.158 143
Directed clustering coefficient c± =0.413 586
Spectral norm α =419.363
Operator 2-norm ν =299.633
Cyclic eigenvalue π =152.932
Reciprocity y =0.378 690
Non-bipartivity bA =0.506 020
Normalized non-bipartivity bN =0.073 999 6
Spectral bipartite frustration bK =0.002 011 38


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 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 ]