Wikipedia links (nds)

This network consists of the wikilinks of the Wikipedia in the Low German language (nds). 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_nds
NameWikipedia links (nds)
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 =36,098
Volume m =516,988
Loop count l =357
Wedge count s =111,132,055
Claw count z =70,055,179,688
Cross count x =46,463,530,626,116
Triangle count t =2,128,755
Square count q =327,466,816
4-Tour count T4 =3,065,077,482
Maximum degree dmax =3,724
Maximum outdegree d+max =672
Maximum indegree dmax =3,689
Average degree d =28.643 6
Fill p =0.000 396 747
Size of LCC N =36,049
Size of LSCC Ns =27,649
Relative size of LSCC Nrs =0.765 943
Diameter δ =11
50-Percentile effective diameter δ0.5 =3.301 89
90-Percentile effective diameter δ0.9 =4.760 18
Median distance δM =4
Mean distance δm =3.858 57
Gini coefficient G =0.706 883
Relative edge distribution entropy Her =0.893 880
Power law exponent γ =1.482 98
Tail power law exponent γt =2.371 00
Degree assortativity ρ =−0.133 024
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.721 975
Clustering coefficient c =0.057 465 6
Directed clustering coefficient c± =0.233 620
Spectral norm α =188.694
Operator 2-norm ν =151.580
Cyclic eigenvalue π =86.175 4
Algebraic connectivity a =0.063 771 4
Reciprocity y =0.423 385
Non-bipartivity bA =0.268 383
Normalized non-bipartivity bN =0.034 412 0
Spectral bipartite frustration bK =0.000 703 215


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 ]