Wikipedia links (ast)

This network consists of the wikilinks of the Wikipedia in the Asturian language (ast). 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

CodeWast
Internal namewikipedia_link_ast
NameWikipedia links (ast)
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 =83,330
Volume m =2,095,962
Loop count l =48
Wedge count s =1,625,113,756
Claw count z =5,133,646,122,624
Cross count x =16,267,437,337,462,290
Triangle count t =4,918,971
Square count q =8,523,707,302
4-Tour count T4 =74,692,486,368
Maximum degree dmax =14,783
Maximum outdegree d+max =1,114
Maximum indegree dmax =14,771
Average degree d =50.305 1
Fill p =0.000 362 928
Size of LCC N =58,865
Size of LSCC Ns =29,552
Relative size of LSCC Nrs =0.501 732
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.586 84
90-Percentile effective diameter δ0.9 =3.658 34
Mean distance δm =3.120 91
Gini coefficient G =0.667 276
Relative edge distribution entropy Her =0.877 926
Power law exponent γ =1.362 69
Tail power law exponent γt =2.201 00
Degree assortativity ρ =−0.159 494
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.151 279
Clustering coefficient c =0.009 080 54
Directed clustering coefficient c± =0.184 603
Spectral norm α =417.295
Operator 2-norm ν =411.611
Cyclic eigenvalue π =88.153 0
Reciprocity y =0.115 298
Non-bipartivity bA =0.025 191 3
Normalized non-bipartivity bN =0.123 448
Spectral bipartite frustration bK =0.001 021 23

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 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 ]