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 =64,161
Volume m =1,354,329
Loop count l =25
Wedge count s =543,650,219
Claw count z =1,035,116,573,116
Cross count x =2,241,762,469,666,058
Triangle count t =9,604,554
Square count q =1,727,707,121
4-Tour count T4 =15,269,688,756
Maximum degree dmax =12,813
Maximum outdegree d+max =8,892
Maximum indegree dmax =12,649
Average degree d =42.216 6
Fill p =0.000 328 989
Size of LCC N =64,125
Size of LSCC Ns =51,819
Relative size of LSCC Nrs =0.807 640
Diameter δ =9
50-Percentile effective diameter δ0.5 =2.801 92
90-Percentile effective diameter δ0.9 =3.961 74
Median distance δM =3
Mean distance δm =3.388 73
Gini coefficient G =0.676 653
Balanced inequality ratio P =0.240 957
Outdegree balanced inequality ratio P+ =0.273 435
Indegree balanced inequality ratio P =0.200 473
Relative edge distribution entropy Her =0.904 949
Power law exponent γ =1.393 66
Tail power law exponent γt =2.551 00
Degree assortativity ρ =−0.085 452 7
Degree assortativity p-value pρ =0.000 00
Clustering coefficient c =0.053 000 4
Directed clustering coefficient c± =0.326 543
Spectral norm α =505.531
Operator 2-norm ν =253.512
Reciprocity y =0.449 667
Non-bipartivity bA =0.588 495
Normalized non-bipartivity bN =0.079 939 9
Spectral bipartite frustration bK =0.001 030 36
Controllability C =19,839
Relative controllability Cr =0.309 207


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 ]