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 =6,293
Volume m =142,571
Loop count l =6
Wedge count s =13,905,387
Claw count z =4,437,646,623
Cross count x =1,456,558,768,546
Triangle count t =1,525,608
Square count q =110,368,794
4-Tour count T4 =938,762,804
Maximum degree dmax =2,073
Maximum outdegree d+max =232
Maximum indegree dmax =2,070
Average degree d =45.311 0
Fill p =0.003 600 11
Size of LCC N =6,291
Size of LSCC Ns =5,023
Relative size of LSCC Nrs =0.798 188
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.666 20
90-Percentile effective diameter δ0.9 =3.878 51
Median distance δM =3
Mean distance δm =3.205 47
Gini coefficient G =0.668 139
Balanced inequality ratio P =0.239 775
Outdegree balanced inequality ratio P+ =0.246 691
Indegree balanced inequality ratio P =0.234 353
Relative edge distribution entropy Her =0.904 694
Power law exponent γ =1.404 44
Tail power law exponent γt =2.701 00
Degree assortativity ρ =−0.098 034 5
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.781 501
Clustering coefficient c =0.329 140
Directed clustering coefficient c± =0.755 530
Operator 2-norm ν =124.378
Cyclic eigenvalue π =107.993
Algebraic connectivity a =0.299 049
Spectral separation 1[A] / λ2[A]| =1.263 11
Reciprocity y =0.660 948
Non-bipartivity bA =0.754 657
Normalized non-bipartivity bN =0.183 788
Algebraic non-bipartivity χ =0.298 914
Spectral bipartite frustration bK =0.002 462 45
Controllability C =1,757
Relative controllability Cr =0.279 199


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 ]