Wikipedia links (mi)

This network consists of the wikilinks of the Wikipedia in the Maori language (mi). 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_mi
NameWikipedia links (mi)
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 =7,982
Volume m =116,542
Loop count l =7
Wedge count s =29,272,342
Claw count z =24,491,971,698
Cross count x =19,302,716,293,203
Triangle count t =1,018,853
Square count q =77,812,209
4-Tour count T4 =739,744,544
Maximum degree dmax =3,829
Maximum outdegree d+max =230
Maximum indegree dmax =3,827
Average degree d =29.201 2
Fill p =0.001 829 19
Size of LCC N =7,980
Size of LSCC Ns =3,700
Relative size of LSCC Nrs =0.463 543
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.076 18
90-Percentile effective diameter δ0.9 =3.074 29
Median distance δM =3
Mean distance δm =2.644 73
Gini coefficient G =0.732 123
Relative edge distribution entropy Her =0.864 556
Power law exponent γ =1.499 36
Tail power law exponent γt =2.071 00
Degree assortativity ρ =−0.159 538
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.855 545
Clustering coefficient c =0.104 418
Directed clustering coefficient c± =0.761 985
Spectral norm α =225.755
Operator 2-norm ν =115.242
Cyclic eigenvalue π =111.219
Algebraic connectivity a =0.234 702
Reciprocity y =0.648 461
Non-bipartivity bA =0.638 320
Normalized non-bipartivity bN =0.083 642 4
Spectral bipartite frustration bK =0.002 765 72


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 ]