Wikipedia links (nds-nl)

This network consists of the wikilinks of the Wikipedia in the Low Saxon language (nds-nl). 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_nl
NameWikipedia links (nds-nl)
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 =10,409
Volume m =140,894
Loop count l =3
Wedge count s =10,708,664
Claw count z =1,722,077,982
Cross count x =268,990,812,966
Triangle count t =609,775
Square count q =28,551,656
4-Tour count T4 =271,465,966
Maximum degree dmax =1,300
Maximum outdegree d+max =423
Maximum indegree dmax =1,228
Average degree d =27.071 6
Fill p =0.001 300 39
Size of LCC N =10,406
Size of LSCC Ns =7,818
Relative size of LSCC Nrs =0.751 081
Diameter δ =8
50-Percentile effective diameter δ0.5 =3.121 52
90-Percentile effective diameter δ0.9 =4.175 40
Median distance δM =4
Mean distance δm =3.602 72
Gini coefficient G =0.659 657
Relative edge distribution entropy Her =0.909 620
Power law exponent γ =1.470 14
Tail power law exponent γt =3.041 00
Degree assortativity ρ =−0.100 897
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.702 286
Clustering coefficient c =0.170 827
Directed clustering coefficient c± =0.388 245
Spectral norm α =129.890
Operator 2-norm ν =79.740 4
Cyclic eigenvalue π =55.168 3
Algebraic connectivity a =0.193 567
Reciprocity y =0.452 276
Non-bipartivity bA =0.640 818
Normalized non-bipartivity bN =0.129 764
Spectral bipartite frustration bK =0.002 306 98


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 ]