Wikipedia links (scn)

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

CodeWscn
Internal namewikipedia_link_scn
NameWikipedia links (scn)
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 =39,957
Volume m =1,182,785
Loop count l =4
Wedge count s =133,663,093
Claw count z =72,619,669,411
Cross count x =34,262,549,581,314
Triangle count t =29,676,577
Square count q =4,549,805,363
4-Tour count T4 =36,871,326,620
Maximum degree dmax =4,592
Maximum outdegree d+max =1,003
Maximum indegree dmax =4,592
Average degree d =59.202 9
Fill p =0.000 751 506
Size of LCC N =39,473
Size of LSCC Ns =25,107
Relative size of LSCC Nrs =0.634 544
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.575 10
90-Percentile effective diameter δ0.9 =4.768 13
Mean distance δm =4.079 85
Gini coefficient G =0.773 307
Balanced inequality ratio P =0.180 655
Outdegree balanced inequality ratio P+ =0.189 679
Indegree balanced inequality ratio P =0.203 938
Relative edge distribution entropy Her =0.887 261
Power law exponent γ =1.463 18
Tail power law exponent γt =1.371 00
Degree assortativity ρ =−0.003 361 03
Degree assortativity p-value pρ =4.827 23 × 10−5
In/outdegree correlation ρ± =+0.806 641
Clustering coefficient c =0.668 168
Directed clustering coefficient c± =0.952 256
Spectral norm α =602.458
Operator 2-norm ν =306.495
Cyclic eigenvalue π =296.000
Algebraic connectivity a =0.042 410 8
Reciprocity y =0.757 404
Non-bipartivity bA =0.862 899
Normalized non-bipartivity bN =0.022 801 9
Spectral bipartite frustration bK =0.000 286 926

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

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 ]