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.


Internal namewikipedia_link_als
NameWikipedia links (als)
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops


Size n =28,591
Volume m =727,005
Loop count l =3,202
Wedge count s =206,804,498
Claw count z =169,642,488,755
Cross count x =146,242,958,635,276
Triangle count t =5,623,007
Square count q =1,114,037,445
4-Tour count T4 =9,740,626,900
Maximum degree dmax =5,129
Maximum outdegree d+max =1,091
Maximum indegree dmax =5,125
Average degree d =50.855 5
Fill p =0.000 889 362
Size of LCC N =28,585
Size of LSCC Ns =24,840
Relative size of LSCC Nrs =0.868 805
Diameter δ =8
50-Percentile effective diameter δ0.5 =2.703 91
90-Percentile effective diameter δ0.9 =3.856 54
Median distance δM =3
Mean distance δm =3.262 34
Gini coefficient G =0.627 697
Relative edge distribution entropy Her =0.918 807
Power law exponent γ =1.359 35
Tail power law exponent γt =2.971 00
Degree assortativity ρ =−0.131 640
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.743 225
Clustering coefficient c =0.081 569 9
Directed clustering coefficient c± =0.418 793
Spectral norm α =270.526
Operator 2-norm ν =215.459
Cyclic eigenvalue π =100.031
Algebraic connectivity a =0.249 979
Reciprocity y =0.469 680
Non-bipartivity bA =0.316 964
Normalized non-bipartivity bN =0.158 861
Spectral bipartite frustration bK =0.001 554 16


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


Matrix decompositions plots



[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]