Wikipedia links (lb)

This network consists of the wikilinks of the Wikipedia in the Luxembourgish language (lb). 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_lb
NameWikipedia links (lb)
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 =62,604
Volume m =1,292,840
Loop count l =23
Wedge count s =513,856,010
Claw count z =950,318,217,892
Cross count x =1,991,243,198,036,237
Triangle count t =8,831,509
Square count q =1,651,533,286
4-Tour count T4 =15,269,688,756
Maximum degree dmax =12,442
Maximum outdegree d+max =8,459
Maximum indegree dmax =12,283
Average degree d =41.302 2
Fill p =0.000 329 868
Size of LCC N =62,565
Size of LSCC Ns =50,630
Relative size of LSCC Nrs =0.808 734
Diameter δ =10
50-Percentile effective diameter δ0.5 =2.810 55
90-Percentile effective diameter δ0.9 =3.933 96
Mean distance δm =3.386 18
Gini coefficient G =0.673 907
Relative edge distribution entropy Her =0.904 554
Power law exponent γ =1.396 25
Tail power law exponent γt =2.491 00
Degree assortativity ρ =−0.088 246 0
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.692 081
Clustering coefficient c =0.051 560 2
Directed clustering coefficient c± =0.325 966
Spectral norm α =505.531
Operator 2-norm ν =253.512
Cyclic eigenvalue π =252.022
Reciprocity y =0.454 216
Non-bipartivity bA =0.586 883
Normalized non-bipartivity bN =0.079 936 6
Spectral bipartite frustration bK =0.001 056 19


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 ]