Wikipedia links (eo)

This network consists of the wikilinks of the Wikipedia in the Esperanto language (eo). 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_eo
NameWikipedia links (eo)
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 =412,997
Volume m =10,424,529
Loop count l =962
Wedge count s =14,839,291,979
Claw count z =90,295,121,465,541
Cross count x =571,072,147,897,726,528
Triangle count t =247,343,461
Maximum degree dmax =35,321
Maximum outdegree d+max =3,145
Maximum indegree dmax =35,311
Average degree d =50.482 3
Size of LCC N =406,532
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.089 28
90-Percentile effective diameter δ0.9 =4.151 34
Mean distance δm =3.607 53
Balanced inequality ratio P =0.192 269
Outdegree balanced inequality ratio P+ =0.222 558
Indegree balanced inequality ratio P =0.141 604
Degree assortativity ρ =−0.101 882
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.680 126
Clustering coefficient c =0.050 884 4
Operator 2-norm ν =700.786
Cyclic eigenvalue π =686.249
Reciprocity y =0.427 372
Non-bipartivity bA =0.514 474
Normalized non-bipartivity bN =0.073 017 2


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 ]