Wikipedia links (io)

This network consists of the wikilinks of the Wikipedia in the Ido language (io). 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_io
NameWikipedia links (io)
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 =30,717
Volume m =744,717
Loop count l =2
Wedge count s =269,875,630
Claw count z =450,747,098,022
Cross count x =790,678,037,833,807
Triangle count t =11,720,186
Square count q =1,945,292,524
4-Tour count T4 =16,642,892,796
Maximum degree dmax =9,331
Maximum outdegree d+max =951
Maximum indegree dmax =9,171
Average degree d =48.488 9
Fill p =0.000 789 285
Size of LCC N =30,663
Size of LSCC Ns =25,005
Relative size of LSCC Nrs =0.814 044
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.753 28
90-Percentile effective diameter δ0.9 =4.420 31
Median distance δM =3
Mean distance δm =3.407 92
Gini coefficient G =0.774 379
Relative edge distribution entropy Her =0.867 028
Power law exponent γ =1.425 83
Tail power law exponent γt =1.781 00
Degree assortativity ρ =−0.099 560 0
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.696 687
Clustering coefficient c =0.130 284
Directed clustering coefficient c± =0.596 711
Spectral norm α =420.885
Operator 2-norm ν =213.247
Cyclic eigenvalue π =209.235
Algebraic connectivity a =0.148 175
Reciprocity y =0.589 953
Non-bipartivity bA =0.505 786
Normalized non-bipartivity bN =0.060 257 6
Spectral bipartite frustration bK =0.001 081 59


Fruchterman–Reingold graph drawing

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 ]