Wikipedia links (vls)

This network consists of the wikilinks of the Wikipedia in the West Flemish language (vls). 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_vls
NameWikipedia links (vls)
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 =9,751
Volume m =123,806
Loop count l =2
Wedge count s =9,758,773
Claw count z =1,637,692,228
Cross count x =204,569,002,688
Triangle count t =802,593
Square count q =67,715,301
4-Tour count T4 =580,946,924
Maximum degree dmax =907
Maximum outdegree d+max =704
Maximum indegree dmax =804
Average degree d =25.393 5
Fill p =0.001 302 10
Size of LCC N =9,743
Size of LSCC Ns =7,628
Relative size of LSCC Nrs =0.782 279
Diameter δ =9
50-Percentile effective diameter δ0.5 =3.104 09
90-Percentile effective diameter δ0.9 =4.219 30
Median distance δM =4
Mean distance δm =3.612 89
Gini coefficient G =0.695 469
Relative edge distribution entropy Her =0.893 943
Power law exponent γ =1.499 74
Tail power law exponent γt =2.511 00
Degree assortativity ρ =−0.063 134 3
Degree assortativity p-value pρ =1.525 19 × 10−166
In/outdegree correlation ρ± =+0.714 207
Clustering coefficient c =0.246 730
Directed clustering coefficient c± =0.553 882
Spectral norm α =234.592
Operator 2-norm ν =125.743
Cyclic eigenvalue π =110.280
Algebraic connectivity a =0.168 730
Reciprocity y =0.469 977
Non-bipartivity bA =0.725 324
Normalized non-bipartivity bN =0.112 524
Spectral bipartite frustration bK =0.002 631 86


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 ]