Wikipedia links (min)

This network consists of the wikilinks of the Wikipedia in the Minangkabau language (min). 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_min
NameWikipedia links (min)
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 =222,989
Volume m =690,651
Loop count l =23
Wedge count s =27,942,278,159
Claw count z =1,355,734,435,886,132
Cross count x =5.283 48 × 1019
Triangle count t =1,313,044
Square count q =14,107,183,574
4-Tour count T4 =224,627,879,644
Maximum degree dmax =166,540
Maximum outdegree d+max =6,452
Maximum indegree dmax =166,539
Average degree d =6.194 48
Fill p =1.389 97 × 10−5
Size of LCC N =221,145
Size of LSCC Ns =4,791
Relative size of LSCC Nrs =0.021 518 8
Diameter δ =54
50-Percentile effective diameter δ0.5 =1.826 01
90-Percentile effective diameter δ0.9 =4.626 24
Median distance δM =2
Mean distance δm =3.069 59
Gini coefficient G =0.647 334
Relative edge distribution entropy Her =0.686 310
Power law exponent γ =2.053 07
Tail power law exponent γt =2.261 00
Degree assortativity ρ =−0.419 809
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.605 252
Clustering coefficient c =0.000 140 974
Directed clustering coefficient c± =0.580 451
Spectral norm α =562.142
Operator 2-norm ν =561.620
Cyclic eigenvalue π =117.095
Algebraic connectivity a =0.000 588 134
Reciprocity y =0.115 492
Non-bipartivity bA =0.000 305 390
Normalized non-bipartivity bN =0.000 267 588
Spectral bipartite frustration bK =5.713 37 × 10−5


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 ]