Wikipedia links (li)

This network consists of the wikilinks of the Wikipedia in the Limburgish language (li). 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_li
NameWikipedia links (li)
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 =48,642
Volume m =363,848
Loop count l =17
Wedge count s =41,791,783
Claw count z =15,869,126,899
Cross count x =8,751,180,244,768
Triangle count t =2,157,615
Square count q =135,167,870
4-Tour count T4 =1,249,082,590
Maximum degree dmax =3,451
Maximum outdegree d+max =610
Maximum indegree dmax =3,402
Average degree d =14.960 2
Fill p =0.000 153 779
Size of LCC N =48,639
Size of LSCC Ns =17,893
Relative size of LSCC Nrs =0.367 851
Diameter δ =8
50-Percentile effective diameter δ0.5 =3.829 73
90-Percentile effective diameter δ0.9 =4.989 21
Median distance δM =4
Mean distance δm =4.363 05
Gini coefficient G =0.825 312
Relative edge distribution entropy Her =0.849 912
Power law exponent γ =2.046 57
Tail power law exponent γt =1.801 00
Degree assortativity ρ =−0.061 916 3
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.813 230
Clustering coefficient c =0.154 883
Directed clustering coefficient c± =0.422 352
Spectral norm α =193.455
Operator 2-norm ν =102.661
Cyclic eigenvalue π =93.238 6
Algebraic connectivity a =0.006 731 08
Reciprocity y =0.426 500
Non-bipartivity bA =0.678 193
Normalized non-bipartivity bN =0.003 336 55
Spectral bipartite frustration bK =0.000 141 260


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 ]