Wikipedia links (et)

This network consists of the wikilinks of the Wikipedia in the Estonian language (et). 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_et
NameWikipedia links (et)
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 =295,546
Volume m =5,143,473
Loop count l =359
Wedge count s =2,235,631,295
Claw count z =3,723,781,561,097
Cross count x =8,094,172,377,338,537
Triangle count t =67,831,894
Square count q =16,719,917,783
Maximum degree dmax =15,594
Maximum outdegree d+max =4,780
Maximum indegree dmax =15,566
Average degree d =34.806 6
Size of LCC N =278,533
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.265 06
90-Percentile effective diameter δ0.9 =4.485 01
Mean distance δm =3.777 31
Balanced inequality ratio P =0.193 303
Outdegree balanced inequality ratio P+ =0.202 891
Indegree balanced inequality ratio P =0.183 539
Degree assortativity ρ =−0.080 318 6
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.745 670
Clustering coefficient c =0.060 766 4
Operator 2-norm ν =418.447
Cyclic eigenvalue π =379.984
Reciprocity y =0.331 267
Non-bipartivity bA =0.748 042
Normalized non-bipartivity bN =0.086 435 1
Spectral bipartite frustration bK =0.001 233 96


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 ]