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 failed tests: *** No loop found although #loop is set
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 =8,194
Volume m =176,938
Loop count l =0
Wedge count s =17,291,962
Claw count z =4,333,935,142
Cross count x =479,638,641,399
Triangle count t =4,458,418
Square count q =615,423,651
4-Tour count T4 =4,992,795,508
Maximum degree dmax =1,312
Maximum outdegree d+max =667
Maximum indegree dmax =1,197
Average degree d =43.187 2
Fill p =0.002 635 62
Size of LCC N =8,136
Size of LSCC Ns =5,109
Relative size of LSCC Nrs =0.623 505
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.511 21
90-Percentile effective diameter δ0.9 =4.863 71
Median distance δM =4
Mean distance δm =4.021 15
Gini coefficient G =0.782 017
Relative edge distribution entropy Her =0.861 357
Power law exponent γ =1.529 92
Tail power law exponent γt =1.511 00
Degree assortativity ρ =+0.222 010
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.725 753
Clustering coefficient c =0.773 495
Directed clustering coefficient c± =0.940 367
Spectral norm α =382.139
Operator 2-norm ν =212.923
Cyclic eigenvalue π =169.217
Algebraic connectivity a =0.014 081 1
Reciprocity y =0.652 341
Non-bipartivity bA =0.881 802
Normalized non-bipartivity bN =0.006 997 60
Spectral bipartite frustration bK =0.000 117 786

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 ]