Wikipedia links (hsb)

This network consists of the wikilinks of the Wikipedia in the Upper Sorbian language (hsb). 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_hsb
NameWikipedia links (hsb)
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 =17,326
Volume m =275,663
Loop count l =585
Wedge count s =117,571,902
Claw count z =119,168,948,225
Cross count x =105,623,303,899,227
Triangle count t =1,845,941
Square count q =465,655,912
4-Tour count T4 =4,195,956,930
Maximum degree dmax =4,397
Maximum outdegree d+max =860
Maximum indegree dmax =4,379
Average degree d =31.820 7
Fill p =0.000 918 294
Size of LCC N =17,307
Size of LSCC Ns =9,821
Relative size of LSCC Nrs =0.566 836
Diameter δ =11
50-Percentile effective diameter δ0.5 =2.939 84
90-Percentile effective diameter δ0.9 =4.298 84
Median distance δM =3
Mean distance δm =3.480 65
Gini coefficient G =0.723 108
Relative edge distribution entropy Her =0.871 895
Power law exponent γ =1.486 51
Tail power law exponent γt =2.681 00
Degree assortativity ρ =−0.208 603
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.773 855
Clustering coefficient c =0.047 101 6
Directed clustering coefficient c± =0.449 679
Spectral norm α =228.399
Operator 2-norm ν =189.558
Cyclic eigenvalue π =101.273
Algebraic connectivity a =0.076 057 7
Reciprocity y =0.466 929
Non-bipartivity bA =0.185 079
Normalized non-bipartivity bN =0.044 764 8
Spectral bipartite frustration bK =0.000 778 283


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


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 ]