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.

Metadata

CodeWsw
Internal namewikipedia_link_sw
NameWikipedia links (sw)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =55,745
Volume m =1,023,272
Loop count l =21
Wedge count s =284,831,297
Claw count z =256,511,739,745
Cross count x =298,832,826,718,936
Triangle count t =15,822,303
Square count q =4,233,602,466
4-Tour count T4 =35,009,803,936
Maximum degree dmax =7,080
Maximum outdegree d+max =2,101
Maximum indegree dmax =6,449
Average degree d =36.712 6
Fill p =0.000 329 291
Size of LCC N =55,733
Size of LSCC Ns =41,061
Relative size of LSCC Nrs =0.736 586
Diameter δ =8
50-Percentile effective diameter δ0.5 =3.153 96
90-Percentile effective diameter δ0.9 =4.246 34
Mean distance δm =3.646 79
Gini coefficient G =0.744 036
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.166 649
Directed clustering coefficient c± =0.426 606
Spectral norm α =419.363
Operator 2-norm ν =299.632
Cyclic eigenvalue π =152.932
Reciprocity y =0.378 690
Non-bipartivity bA =0.506 020
Normalized non-bipartivity bN =0.072 293 5
Spectral bipartite frustration bK =0.002 016 15

Plots

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

SynGraphy

Matrix decompositions plots

Downloads

References

[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]