Wikipedia links (nso)

This network consists of the wikilinks of the Wikipedia in the Northern Sotho language (nso). 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_nso
NameWikipedia links (nso)
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 =8,146
Volume m =455,878
Loop count l =1
Wedge count s =102,781,827
Claw count z =77,330,314,035
Cross count x =37,222,991,125,686
Triangle count t =14,092,467
Square count q =3,285,199,041
4-Tour count T4 =26,693,309,674
Maximum degree dmax =4,340
Maximum outdegree d+max =2,024
Maximum indegree dmax =2,696
Average degree d =111.927
Fill p =0.006 870 05
Size of LCC N =8,146
Size of LSCC Ns =6,873
Relative size of LSCC Nrs =0.843 727
Diameter δ =11
50-Percentile effective diameter δ0.5 =2.772 22
90-Percentile effective diameter δ0.9 =3.883 73
Median distance δM =3
Mean distance δm =3.234 27
Gini coefficient G =0.638 413
Relative edge distribution entropy Her =0.908 713
Power law exponent γ =1.277 75
Tail power law exponent γt =2.011 00
Degree assortativity ρ =−0.213 182
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.648 353
Clustering coefficient c =0.411 331
Directed clustering coefficient c± =0.895 557
Spectral norm α =726.563
Operator 2-norm ν =367.833
Cyclic eigenvalue π =358.554
Algebraic connectivity a =0.056 634 5
Reciprocity y =0.705 709
Non-bipartivity bA =0.798 779
Normalized non-bipartivity bN =0.073 494 1
Spectral bipartite frustration bK =0.000 475 196


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 ]