Wikipedia links (co)

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

CodeWco
Internal namewikipedia_link_co
NameWikipedia links (co)
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
LoopsDoes not contain loops

Statistics

Size n =8,252
Volume m =177,420
Loop count l =0
Wedge count s =17,435,542
Claw count z =4,369,193,623
Cross count x =488,079,052,775
Triangle count t =4,484,262
Square count q =621,651,814
4-Tour count T4 =5,043,196,260
Maximum degree dmax =1,326
Maximum outdegree d+max =667
Maximum indegree dmax =1,208
Average degree d =43.000 5
Fill p =0.002 605 77
Size of LCC N =8,194
Size of LSCC Ns =5,150
Relative size of LSCC Nrs =0.624 091
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.561 64
90-Percentile effective diameter δ0.9 =4.898 16
Median distance δM =4
Mean distance δm =4.074 67
Gini coefficient G =0.782 615
Balanced inequality ratio P =0.170 812
Outdegree balanced inequality ratio P+ =0.167 196
Indegree balanced inequality ratio P =0.173 408
Relative edge distribution entropy Her =0.861 081
Power law exponent γ =1.530 69
Tail power law exponent γt =1.511 00
Tail power law exponent with p γ3 =1.511 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =1.511 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =1.471 00
Indegree p-value pi =0.000 00
In/outdegree correlation ρ± =+0.723 992
Clustering coefficient c =0.771 573
Directed clustering coefficient c± =0.939 149
Spectral norm α =382.660
Algebraic connectivity a =0.014 081 0
Spectral separation 1[A] / λ2[A]| =1.642 15
Reciprocity y =0.649 645
Normalized non-bipartivity bN =0.006 997 65
Spectral bipartite frustration bK =0.000 118 068
Controllability C =3,492
Relative controllability Cr =0.423 170

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 ]