Wikipedia links (fiu-vro)

This network consists of the wikilinks of the Wikipedia in the Võro language (fiu-vro). 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_fiu_vro
NameWikipedia links (fiu-vro)
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 =6,370
Volume m =280,371
Loop count l =2
Wedge count s =45,674,802
Claw count z =37,581,809,519
Cross count x =7,517,884,920,808
Triangle count t =13,032,976
Square count q =3,345,395,035
4-Tour count T4 =26,946,172,536
Maximum degree dmax =2,285
Maximum outdegree d+max =437
Maximum indegree dmax =2,245
Average degree d =88.028 6
Fill p =0.006 909 62
Size of LCC N =6,347
Size of LSCC Ns =4,773
Relative size of LSCC Nrs =0.749 294
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.726 42
90-Percentile effective diameter δ0.9 =4.134 42
Median distance δM =3
Mean distance δm =3.322 08
Gini coefficient G =0.828 151
Relative edge distribution entropy Her =0.824 574
Power law exponent γ =1.443 54
Tail power law exponent γt =1.661 00
Degree assortativity ρ =+0.162 964
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.884 704
Clustering coefficient c =0.856 028
Directed clustering coefficient c± =0.970 665
Spectral norm α =760.305
Operator 2-norm ν =382.220
Cyclic eigenvalue π =378.068
Algebraic connectivity a =0.135 752
Reciprocity y =0.883 444
Non-bipartivity bA =0.935 199
Normalized non-bipartivity bN =0.064 821 6
Spectral bipartite frustration bK =0.000 620 367


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

Double Laplacian graph drawing

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 ]