Wikipedia links (my)

This network consists of the wikilinks of the Wikipedia in the Burmese language (my). 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_my
NameWikipedia links (my)
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 =44,651
Volume m =1,201,350
Loop count l =53
Wedge count s =1,485,249,192
Claw count z =7,463,531,386,919
Cross count x =35,855,459,138,091,844
Triangle count t =44,466,264
Square count q =21,106,852,678
4-Tour count T4 =168,799,182,228
Maximum degree dmax =23,161
Maximum outdegree d+max =866
Maximum indegree dmax =22,888
Average degree d =53.810 7
Fill p =0.000 609 069
Size of LCC N =43,917
Size of LSCC Ns =14,020
Relative size of LSCC Nrs =0.320 172
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.044 50
90-Percentile effective diameter δ0.9 =4.608 58
Median distance δM =4
Mean distance δm =3.529 64
Gini coefficient G =0.824 622
Balanced inequality ratio P =0.151 351
Outdegree balanced inequality ratio P+ =0.184 749
Indegree balanced inequality ratio P =0.157 796
Relative edge distribution entropy Her =0.829 247
Power law exponent γ =1.447 88
Tail power law exponent γt =1.831 00
Degree assortativity ρ =−0.124 427
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.526 869
Clustering coefficient c =0.089 815 8
Directed clustering coefficient c± =0.825 873
Spectral norm α =930.170
Operator 2-norm ν =476.999
Cyclic eigenvalue π =453.069
Algebraic connectivity a =0.016 762 3
Reciprocity y =0.545 875
Non-bipartivity bA =0.593 819
Normalized non-bipartivity bN =0.032 561 5
Spectral bipartite frustration bK =0.000 399 990


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 ]