Wikipedia links (als)

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

CodeWals
Internal namewikipedia_link_als
NameWikipedia links (als)
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 =29,511
Volume m =763,424
Loop count l =3,635
Wedge count s =230,283,499
Claw count z =202,323,613,876
Cross count x =185,773,567,226,390
Triangle count t =5,879,976
Square count q =1,228,527,129
4-Tour count T4 =10,750,516,986
Maximum degree dmax =5,524
Maximum outdegree d+max =1,093
Maximum indegree dmax =5,484
Average degree d =51.738 3
Fill p =0.000 876 593
Size of LCC N =29,505
Size of LSCC Ns =25,785
Relative size of LSCC Nrs =0.873 742
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.679 44
90-Percentile effective diameter δ0.9 =3.847 74
Median distance δM =3
Mean distance δm =3.242 58
Gini coefficient G =0.623 887
Balanced inequality ratio P =0.266 989
Outdegree balanced inequality ratio P+ =0.289 468
Indegree balanced inequality ratio P =0.241 393
Relative edge distribution entropy Her =0.919 292
Power law exponent γ =1.356 16
Tail power law exponent γt =3.021 00
Tail power law exponent with p γ3 =3.021 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =3.731 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.651 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.131 966
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.746 684
Clustering coefficient c =0.076 600 9
Directed clustering coefficient c± =0.410 972
Spectral norm α =278.304
Operator 2-norm ν =224.116
Cyclic eigenvalue π =100.057
Algebraic connectivity a =0.249 983
Spectral separation 1[A] / λ2[A]| =1.232 01
Reciprocity y =0.467 964
Non-bipartivity bA =0.315 358
Normalized non-bipartivity bN =0.158 865
Algebraic non-bipartivity χ =0.242 654
Spectral bipartite frustration bK =0.001 525 61
Controllability C =4,743
Relative controllability Cr =0.160 720

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 ]