Wikipedia links (mhr)

This network consists of the wikilinks of the Wikipedia in the Eastern Mari language (mhr). 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_mhr
NameWikipedia links (mhr)
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 =14,360
Volume m =220,699
Loop count l =4
Wedge count s =84,466,530
Claw count z =84,567,558,423
Cross count x =75,341,788,621,473
Triangle count t =1,396,410
Square count q =352,213,827
4-Tour count T4 =3,155,922,276
Maximum degree dmax =4,523
Maximum outdegree d+max =2,935
Maximum indegree dmax =4,422
Average degree d =30.738 0
Fill p =0.001 070 27
Size of LCC N =14,344
Size of LSCC Ns =7,109
Relative size of LSCC Nrs =0.495 056
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.892 32
90-Percentile effective diameter δ0.9 =4.171 77
Median distance δM =3
Mean distance δm =3.429 59
Gini coefficient G =0.704 780
Relative edge distribution entropy Her =0.876 172
Power law exponent γ =1.475 80
Tail power law exponent γt =2.681 00
Degree assortativity ρ =−0.184 334
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.684 788
Clustering coefficient c =0.049 596 3
Directed clustering coefficient c± =0.550 338
Spectral norm α =285.076
Operator 2-norm ν =176.678
Cyclic eigenvalue π =142.022
Algebraic connectivity a =0.120 442
Reciprocity y =0.434 320
Non-bipartivity bA =0.368 869
Normalized non-bipartivity bN =0.075 984 7
Spectral bipartite frustration bK =0.001 249 96


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 ]