Wikipedia links (vo)

This network consists of the wikilinks of the Wikipedia in the Volapük language (vo). 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_vo
NameWikipedia links (vo)
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 =242,046
Volume m =761,034
Loop count l =2
Wedge count s =10,075,128,352
Claw count z =278,930,268,453,196
Cross count x =6,223,346,749,115,456,512
Triangle count t =1,985,412
Square count q =5,905,528,926
4-Tour count T4 =87,515,024,524
Maximum degree dmax =94,726
Maximum outdegree d+max =2,224
Maximum indegree dmax =94,725
Average degree d =6.288 34
Fill p =1.302 20 × 10−5
Size of LCC N =242,014
Size of LSCC Ns =9,487
Relative size of LSCC Nrs =0.039 297 1
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.686 64
90-Percentile effective diameter δ0.9 =3.831 58
Median distance δM =3
Mean distance δm =3.223 85
Gini coefficient G =0.719 317
Balanced inequality ratio P =0.226 732
Outdegree balanced inequality ratio P+ =0.309 610
Indegree balanced inequality ratio P =0.169 581
Relative edge distribution entropy Her =0.783 208
Power law exponent γ =2.236 23
Tail power law exponent γt =2.371 00
Degree assortativity ρ =−0.220 368
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.666 146
Clustering coefficient c =0.000 591 182
Directed clustering coefficient c± =0.337 596
Spectral norm α =450.745
Operator 2-norm ν =449.408
Cyclic eigenvalue π =133.031
Algebraic connectivity a =0.052 655 7
Reciprocity y =0.231 889
Non-bipartivity bA =0.004 832 50
Normalized non-bipartivity bN =0.026 913 2
Spectral bipartite frustration bK =0.002 366 89


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 ]