Wikipedia links (mg)

This network consists of the wikilinks of the Wikipedia in the Malagasy language (mg). 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_mg
NameWikipedia links (mg)
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 =125,916
Volume m =1,025,610
Loop count l =3
Wedge count s =7,066,287,073
Claw count z =100,716,948,502,027
Cross count x =1,258,716,710,237,220,864
Triangle count t =11,643,077
Square count q =46,512,204,582
4-Tour count T4 =411,843,106,194
Maximum degree dmax =65,118
Maximum outdegree d+max =3,289
Maximum indegree dmax =65,114
Average degree d =16.290 4
Fill p =6.638 65 × 10−5
Size of LCC N =125,855
Size of LSCC Ns =34,123
Relative size of LSCC Nrs =0.271 676
Diameter δ =11
50-Percentile effective diameter δ0.5 =2.801 47
90-Percentile effective diameter δ0.9 =4.817 87
Median distance δM =3
Mean distance δm =3.515 78
Gini coefficient G =0.789 963
Balanced inequality ratio P =0.193 507
Outdegree balanced inequality ratio P+ =0.265 117
Indegree balanced inequality ratio P =0.089 618 9
Relative edge distribution entropy Her =0.756 841
Power law exponent γ =1.717 13
Tail power law exponent γt =1.551 00
Degree assortativity ρ =−0.208 488
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.358 689
Clustering coefficient c =0.004 943 08
Directed clustering coefficient c± =0.534 861
Spectral norm α =646.530
Operator 2-norm ν =614.924
Cyclic eigenvalue π =62.104 6
Algebraic connectivity a =0.001 604 56
Reciprocity y =0.031 894 3
Non-bipartivity bA =0.092 206 7
Normalized non-bipartivity bN =0.006 299 97
Spectral bipartite frustration bK =0.000 380 714


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 ]