Wikipedia links (yo)

This network consists of the wikilinks of the Wikipedia in the Yoruba language (yo). 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_yo
NameWikipedia links (yo)
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 =41,205
Volume m =1,042,990
Loop count l =144
Wedge count s =254,616,345
Claw count z =595,465,117,112
Cross count x =1,985,410,209,967,173
Triangle count t =38,275,268
Square count q =10,057,373,941
4-Tour count T4 =81,472,601,980
Maximum degree dmax =14,758
Maximum outdegree d+max =834
Maximum indegree dmax =14,757
Average degree d =50.624 4
Fill p =0.000 614 513
Size of LCC N =40,801
Size of LSCC Ns =18,872
Relative size of LSCC Nrs =0.458 203
Diameter δ =13
50-Percentile effective diameter δ0.5 =4.200 30
90-Percentile effective diameter δ0.9 =5.617 42
Median distance δM =5
Mean distance δm =4.478 41
Gini coefficient G =0.815 127
Balanced inequality ratio P =0.169 417
Outdegree balanced inequality ratio P+ =0.163 762
Indegree balanced inequality ratio P =0.229 658
Relative edge distribution entropy Her =0.864 737
Power law exponent γ =1.602 21
Tail power law exponent γt =2.121 00
Degree assortativity ρ =−0.030 211 4
Degree assortativity p-value pρ =1.520 84 × 10−278
In/outdegree correlation ρ± =+0.779 886
Clustering coefficient c =0.450 976
Directed clustering coefficient c± =0.946 739
Spectral norm α =729.446
Operator 2-norm ν =401.894
Cyclic eigenvalue π =269.472
Algebraic connectivity a =0.003 021 21
Reciprocity y =0.663 800
Non-bipartivity bA =0.833 499
Normalized non-bipartivity bN =0.007 265 22
Spectral bipartite frustration bK =0.000 106 335


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 ]