Wikipedia links (en)

This network consists of the wikilinks of the Wikipedia in the English language (en). 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

CodeWen
Internal namewikipedia_link_en
NameWikipedia links (en)
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 =13,593,032
Volume m =437,217,424
Loop count l =49,466
Wedge count s =2,840,041,464,182
Claw count z =291,864,259,650,656,704
Cross count x =5.022 41 × 1022
Triangle count t =13,540,543,134
Maximum degree dmax =1,033,785
Maximum outdegree d+max =9,466
Maximum indegree dmax =1,033,523
Average degree d =64.329 6
Fill p =8.132 18 × 10−7
Size of LCC N =13,274,309
Size of LSCC Ns =7,283,915
Relative size of LSCC Nrs =0.599 451
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.469 67
90-Percentile effective diameter δ0.9 =4.584 90
Mean distance δm =3.961 78
Balanced inequality ratio P =0.154 553
Outdegree balanced inequality ratio P+ =0.161 551
Indegree balanced inequality ratio P =0.167 029
Relative edge distribution entropy Her =0.858 039
Power law exponent γ =1.431 65
Degree assortativity ρ =−0.017 980 4
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.015 080 3
Spectral norm α =5,069.27
Reciprocity y =0.470 890
Non-bipartivity bA =0.397 307
Normalized non-bipartivity bN =0.018 197 8

Plots

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

Hop distribution

In/outdegree scatter plot

Edge weight/multiplicity distribution

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 ]