Wikipedia links (simple)

This network consists of the wikilinks of the Wikipedia in the Simple English language (simple). 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_simple
NameWikipedia links (simple)
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 =185,262
Volume m =5,098,259
Loop count l =513
Wedge count s =1,999,105,088
Claw count z =3,534,911,521,252
Cross count x =8,891,447,734,189,179
Triangle count t =197,848,138
Square count q =77,830,596,597
Maximum degree dmax =18,670
Maximum outdegree d+max =2,039
Maximum indegree dmax =18,154
Average degree d =55.038 4
Size of LCC N =179,674
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.954 19
90-Percentile effective diameter δ0.9 =3.935 20
Mean distance δm =3.500 76
Balanced inequality ratio P =0.180 973
Outdegree balanced inequality ratio P+ =0.194 384
Indegree balanced inequality ratio P =0.163 220
Degree assortativity ρ =−0.051 676 4
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.643 177
Clustering coefficient c =0.283 922
Directed clustering coefficient c± =0.783 781
Operator 2-norm ν =700.682
Cyclic eigenvalue π =682.022
Reciprocity y =0.502 593
Non-bipartivity bA =0.852 236
Normalized non-bipartivity bN =0.052 780 8
Spectral bipartite frustration bK =0.000 611 736


Degree distribution

Cumulative degree distribution

Hop distribution

In/outdegree scatter plot


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 ]