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.

Metadata

CodeWmin
Internal namewikipedia_link_min
NameWikipedia links (min)
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 =222,989
Volume m =690,651
Loop count l =23
Wedge count s =27,943,389,819
Claw count z =1,355,716,517,159,955
Cross count x =5.283 3 × 1019
Triangle count t =1,317,226
Square count q =14,109,056,101
4-Tour count T4 =224,647,309,396
Maximum degree dmax =166,538
Maximum outdegree d+max =6,452
Maximum indegree dmax =166,537
Average degree d =6.194 48
Fill p =1.388 97 × 10−5
Size of LCC N =221,481
Size of LSCC Ns =4,869
Relative size of LSCC Nrs =0.021 835 2
Diameter δ =54
50-Percentile effective diameter δ0.5 =1.826 58
90-Percentile effective diameter δ0.9 =4.613 30
Median distance δM =2
Mean distance δm =3.062 46
Gini coefficient G =0.647 843
Balanced inequality ratio P =0.261 259
Outdegree balanced inequality ratio P+ =0.384 088
Indegree balanced inequality ratio P =0.080 004 2
Relative edge distribution entropy Her =0.686 764
Power law exponent γ =2.053 13
Tail power law exponent γt =2.291 00
Tail power law exponent with p γ3 =2.291 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =3.531 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.091 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.418 539
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.605 699
Clustering coefficient c =0.000 141 417
Directed clustering coefficient c± =0.576 658
Spectral norm α =562.140
Operator 2-norm ν =561.618
Cyclic eigenvalue π =117.095
Algebraic connectivity a =0.000 596 585
Spectral separation 1[A] / λ2[A]| =1.000 31
Reciprocity y =0.115 785
Non-bipartivity bA =0.000 305 371
Normalized non-bipartivity bN =0.000 267 588
Algebraic non-bipartivity χ =0.001 339 72
Spectral bipartite frustration bK =5.713 37 × 10−5
Controllability C =216,920
Relative controllability Cr =0.972 783

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

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 ]