Wikipedia links (gv)

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

CodeWgv
Internal namewikipedia_link_gv
NameWikipedia links (gv)
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 =6,862
Volume m =150,595
Loop count l =42
Wedge count s =16,824,646
Claw count z =6,763,919,538
Cross count x =3,616,152,997,828
Triangle count t =1,504,330
Square count q =108,969,584
4-Tour count T4 =939,266,794
Maximum degree dmax =2,986
Maximum outdegree d+max =378
Maximum indegree dmax =2,984
Average degree d =43.892 5
Fill p =0.003 198 23
Size of LCC N =6,858
Size of LSCC Ns =4,990
Relative size of LSCC Nrs =0.727 193
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.442 81
90-Percentile effective diameter δ0.9 =3.779 52
Median distance δM =3
Mean distance δm =3.007 79
Gini coefficient G =0.680 480
Balanced inequality ratio P =0.236 379
Outdegree balanced inequality ratio P+ =0.241 947
Indegree balanced inequality ratio P =0.239 696
Relative edge distribution entropy Her =0.901 089
Power law exponent γ =1.419 69
Tail power law exponent γt =2.781 00
Tail power law exponent with p γ3 =2.781 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =3.061 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.991 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.076 681 6
Degree assortativity p-value pρ =2.877 11 × 10−273
In/outdegree correlation ρ± =+0.758 427
Clustering coefficient c =0.268 237
Directed clustering coefficient c± =0.693 593
Operator 2-norm ν =122.504
Spectral separation 1[A] / λ2[A]| =1.338 36
Reciprocity y =0.595 040
Normalized non-bipartivity bN =0.179 420
Spectral bipartite frustration bK =0.002 170 25
Controllability C =2,028
Relative controllability Cr =0.295 541

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

Double Laplacian graph drawing

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 ]