Wikipedia links (wa)

This network consists of the wikilinks of the Wikipedia in the Walloon language (wa). 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_wa
NameWikipedia links (wa)
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 =28,814
Volume m =159,841
Loop count l =3,841
Wedge count s =18,831,926
Claw count z =14,088,919,547
Cross count x =13,273,727,172,598
Triangle count t =221,118
Square count q =13,277,613
4-Tour count T4 =181,825,550
Maximum degree dmax =4,198
Maximum outdegree d+max =1,028
Maximum indegree dmax =4,176
Average degree d =11.094 7
Fill p =0.000 192 522
Size of LCC N =28,773
Size of LSCC Ns =22,232
Relative size of LSCC Nrs =0.771 569
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.446 17
90-Percentile effective diameter δ0.9 =4.572 65
Median distance δM =4
Mean distance δm =3.922 55
Gini coefficient G =0.652 413
Relative edge distribution entropy Her =0.904 730
Power law exponent γ =1.657 45
Tail power law exponent γt =2.781 00
Degree assortativity ρ =−0.051 134 0
Degree assortativity p-value pρ =1.063 16 × 10−159
In/outdegree correlation ρ± =+0.553 710
Clustering coefficient c =0.035 225 0
Directed clustering coefficient c± =0.192 857
Spectral norm α =112.652
Operator 2-norm ν =72.771 5
Cyclic eigenvalue π =51.992 1
Algebraic connectivity a =0.153 968
Reciprocity y =0.243 361
Non-bipartivity bA =0.399 114
Normalized non-bipartivity bN =0.079 907 0
Spectral bipartite frustration bK =0.003 898 59


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 ]