Wikipedia links (mn)

This network consists of the wikilinks of the Wikipedia in the Mongolian language (mn). 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_mn
NameWikipedia links (mn)
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 =24,924
Volume m =488,451
Loop count l =312
Wedge count s =78,957,433
Claw count z =45,727,328,891
Cross count x =13,624,045,323,781
Triangle count t =10,952,341
Square count q =2,721,819,095
4-Tour count T4 =21,979,662,940
Maximum degree dmax =3,224
Maximum outdegree d+max =658
Maximum indegree dmax =3,202
Average degree d =39.195 2
Fill p =0.000 797 755
Size of LCC N =24,689
Size of LSCC Ns =15,861
Relative size of LSCC Nrs =0.647 599
Diameter δ =13
50-Percentile effective diameter δ0.5 =2.951 30
90-Percentile effective diameter δ0.9 =4.007 56
Median distance δM =3
Mean distance δm =3.509 16
Gini coefficient G =0.764 154
Balanced inequality ratio P =0.198 503
Outdegree balanced inequality ratio P+ =0.209 405
Indegree balanced inequality ratio P =0.182 319
Relative edge distribution entropy Her =0.866 397
Power law exponent γ =1.452 93
Tail power law exponent γt =2.231 00
Degree assortativity ρ =−0.008 909 09
Degree assortativity p-value pρ =6.775 55 × 10−14
In/outdegree correlation ρ± =+0.590 285
Clustering coefficient c =0.416 136
Directed clustering coefficient c± =0.788 270
Spectral norm α =739.334
Operator 2-norm ν =372.851
Cyclic eigenvalue π =366.347
Algebraic connectivity a =0.039 732 8
Reciprocity y =0.521 561
Non-bipartivity bA =0.897 849
Normalized non-bipartivity bN =0.020 976 0
Spectral bipartite frustration bK =0.000 325 560


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 ]