Wikipedia links (ia)

This network consists of the wikilinks of the Wikipedia in the Interlingua language (ia). 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_ia
NameWikipedia links (ia)
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 =23,728
Volume m =2,195,690
Loop count l =2
Wedge count s =455,596,100
Claw count z =454,844,699,969
Cross count x =237,311,271,378,366
Triangle count t =122,931,947
Square count q =34,466,570,216
4-Tour count T4 =277,557,360,564
Maximum degree dmax =6,616
Maximum outdegree d+max =625
Maximum indegree dmax =6,579
Average degree d =185.072
Fill p =0.003 899 86
Size of LCC N =23,685
Size of LSCC Ns =14,504
Relative size of LSCC Nrs =0.611 261
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.054 60
90-Percentile effective diameter δ0.9 =4.374 83
Mean distance δm =3.538 75
Gini coefficient G =0.725 791
Relative edge distribution entropy Her =0.896 079
Power law exponent γ =1.351 98
Tail power law exponent γt =1.371 00
Degree assortativity ρ =+0.021 988 8
Degree assortativity p-value pρ =6.456 36 × 10−256
In/outdegree correlation ρ± =+0.891 555
Clustering coefficient c =0.809 480
Directed clustering coefficient c± =0.988 634
Spectral norm α =1,065.43
Operator 2-norm ν =541.534
Cyclic eigenvalue π =524.019
Algebraic connectivity a =0.110 829
Reciprocity y =0.900 374
Non-bipartivity bA =0.943 858
Normalized non-bipartivity bN =0.044 347 6
Spectral bipartite frustration bK =0.000 287 906
Controllability C =8,238
Relative controllability Cr =0.347 185


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 Laplacian

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


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 ]