Wikipedia links (myv)

This network consists of the wikilinks of the Wikipedia in the Erzya language (myv). 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_myv
NameWikipedia links (myv)
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 =5,041
Volume m =106,417
Loop count l =5
Wedge count s =8,507,947
Claw count z =1,876,594,822
Cross count x =327,328,052,326
Triangle count t =1,192,055
Square count q =88,770,561
4-Tour count T4 =744,336,370
Maximum degree dmax =1,393
Maximum outdegree d+max =200
Maximum indegree dmax =1,390
Average degree d =42.220 6
Fill p =0.004 187 72
Size of LCC N =5,037
Size of LSCC Ns =3,966
Relative size of LSCC Nrs =0.786 749
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.677 03
90-Percentile effective diameter δ0.9 =3.906 86
Median distance δM =3
Mean distance δm =3.249 08
Gini coefficient G =0.684 590
Relative edge distribution entropy Her =0.897 477
Power law exponent γ =1.425 78
Tail power law exponent γt =2.661 00
Degree assortativity ρ =−0.108 812
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.801 136
Clustering coefficient c =0.420 332
Directed clustering coefficient c± =0.812 074
Spectral norm α =231.155
Operator 2-norm ν =124.092
Cyclic eigenvalue π =107.993
Algebraic connectivity a =0.298 325
Reciprocity y =0.683 490
Non-bipartivity bA =0.794 134
Normalized non-bipartivity bN =0.184 322
Spectral bipartite frustration bK =0.002 680 18


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 ]