Wikipedia links (an)

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

CodeWan
Internal namewikipedia_link_an
NameWikipedia links (an)
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 =56,485
Volume m =1,306,724
Loop count l =15
Wedge count s =1,245,984,407
Claw count z =2,997,409,548,602
Cross count x =7,094,334,861,474,512
Triangle count t =10,923,341
Square count q =8,273,742,939
4-Tour count T4 =68,963,459,778
Maximum degree dmax =13,084
Maximum outdegree d+max =809
Maximum indegree dmax =13,077
Average degree d =46.268 0
Fill p =0.000 411 402
Size of LCC N =56,481
Size of LSCC Ns =33,601
Relative size of LSCC Nrs =0.601 748
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.796 26
90-Percentile effective diameter δ0.9 =3.870 58
Median distance δM =3
Mean distance δm =3.329 38
Gini coefficient G =0.738 058
Balanced inequality ratio P =0.214 874
Outdegree balanced inequality ratio P+ =0.238 386
Indegree balanced inequality ratio P =0.192 280
Relative edge distribution entropy Her =0.875 994
Power law exponent γ =1.447 55
Tail power law exponent γt =2.631 00
Degree assortativity ρ =−0.165 356
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.692 936
Clustering coefficient c =0.026 300 5
Directed clustering coefficient c± =0.291 529
Spectral norm α =440.105
Operator 2-norm ν =404.996
Cyclic eigenvalue π =106.180
Reciprocity y =0.322 504
Non-bipartivity bA =0.147 899
Normalized non-bipartivity bN =0.075 946 9
Spectral bipartite frustration bK =0.000 887 565

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 ]