Wikipedia links (sco)

This network consists of the wikilinks of the Wikipedia in the Scots language (sco). 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_sco
NameWikipedia links (sco)
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 =59,555
Volume m =1,304,012
Loop count l =392
Wedge count s =348,086,929
Claw count z =496,979,822,813
Cross count x =933,001,896,281,771
Triangle count t =15,072,232
Square count q =1,822,535,050
4-Tour count T4 =15,974,561,712
Maximum degree dmax =10,338
Maximum outdegree d+max =644
Maximum indegree dmax =10,337
Average degree d =43.791 9
Fill p =0.000 367 659
Size of LCC N =59,486
Size of LSCC Ns =43,724
Relative size of LSCC Nrs =0.734 178
Diameter δ =13
50-Percentile effective diameter δ0.5 =2.944 81
90-Percentile effective diameter δ0.9 =3.990 58
Mean distance δm =3.491 77
Gini coefficient G =0.705 635
Relative edge distribution entropy Her =0.906 297
Power law exponent γ =1.406 89
Tail power law exponent γt =2.061 00
Degree assortativity ρ =−0.065 841 0
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.693 760
Clustering coefficient c =0.129 901
Directed clustering coefficient c± =0.715 467
Spectral norm α =420.183
Operator 2-norm ν =217.999
Cyclic eigenvalue π =208.042
Reciprocity y =0.516 894
Non-bipartivity bA =0.636 796
Normalized non-bipartivity bN =0.049 209 8
Spectral bipartite frustration bK =0.000 681 998


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 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 ]