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.

Metadata

CodeWmn
Internal namewikipedia_link_mn
NameWikipedia links (mn)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

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 =22,091,104,240
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 786 295
Size of LCC N =24,689
Size of LSCC Ns =16,209
Relative size of LSCC Nrs =0.650 337
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 302
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 946
Power law exponent γ =1.452 48
Tail power law exponent γt =2.241 00
Tail power law exponent with p γ3 =2.241 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =2.311 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.021 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.011 108 9
Degree assortativity p-value pρ =3.802 04 × 10−21
In/outdegree correlation ρ± =+0.593 911
Clustering coefficient c =0.416 136
Directed clustering coefficient c± =0.788 270
Spectral norm α =739.353
Operator 2-norm ν =372.851
Cyclic eigenvalue π =366.350
Algebraic connectivity a =0.039 738 4
Spectral separation 1[A] / λ2[A]| =3.792 63
Reciprocity y =0.521 735
Non-bipartivity bA =0.897 887
Normalized non-bipartivity bN =0.020 976 0
Algebraic non-bipartivity χ =0.038 088 5
Spectral bipartite frustration bK =0.000 325 560
Controllability C =9,062
Relative controllability Cr =0.363 585

Plots

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

SynGraphy

Matrix decompositions plots

Downloads

References

[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]