Wikipedia links (ilo)

This network consists of the wikilinks of the Wikipedia in the Iloko language (ilo). 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_ilo
NameWikipedia links (ilo)
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 =20,338
Volume m =1,239,616
Loop count l =67
Wedge count s =376,533,971
Claw count z =283,069,992,134
Cross count x =94,615,279,366,146
Triangle count t =79,320,594
Square count q =30,528,595,654
4-Tour count T4 =245,736,571,578
Maximum degree dmax =3,345
Maximum outdegree d+max =1,749
Maximum indegree dmax =2,849
Average degree d =121.901
Fill p =0.002 996 89
Size of LCC N =20,311
Size of LSCC Ns =14,402
Relative size of LSCC Nrs =0.708 133
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.915 18
90-Percentile effective diameter δ0.9 =3.972 14
Mean distance δm =3.425 24
Gini coefficient G =0.795 206
Relative edge distribution entropy Her =0.869 383
Power law exponent γ =1.394 06
Tail power law exponent γt =1.441 00
Degree assortativity ρ =−0.022 982 9
Degree assortativity p-value pρ =5.978 84 × 10−194
In/outdegree correlation ρ± =+0.837 049
Clustering coefficient c =0.631 980
Directed clustering coefficient c± =0.861 236
Spectral norm α =1,062.10
Operator 2-norm ν =572.875
Cyclic eigenvalue π =488.061
Algebraic connectivity a =0.232 790
Reciprocity y =0.652 382
Non-bipartivity bA =0.858 507
Normalized non-bipartivity bN =0.147 012
Spectral bipartite frustration bK =0.000 708 716


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 ]