Wikipedia links (ht)

This network consists of the wikilinks of the Wikipedia in the Haitian Creole language (ht). 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_ht
NameWikipedia links (ht)
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 =57,219
Volume m =384,030
Loop count l =2
Wedge count s =1,713,317,394
Claw count z =11,735,974,919,361
Cross count x =73,201,754,085,871,680
Triangle count t =888,312
Square count q =3,030,419,841
4-Tour count T4 =29,941,402,018
Maximum degree dmax =32,719
Maximum outdegree d+max =263
Maximum indegree dmax =32,718
Average degree d =13.423 2
Fill p =0.000 116 886
Size of LCC N =57,014
Size of LSCC Ns =7,785
Relative size of LSCC Nrs =0.137 171
Diameter δ =12
50-Percentile effective diameter δ0.5 =2.425 00
90-Percentile effective diameter δ0.9 =4.345 26
Median distance δM =3
Mean distance δm =3.133 38
Gini coefficient G =0.677 337
Balanced inequality ratio P =0.257 093
Outdegree balanced inequality ratio P+ =0.364 818
Indegree balanced inequality ratio P =0.092 274 0
Relative edge distribution entropy Her =0.776 830
Power law exponent γ =1.615 59
Tail power law exponent γt =2.011 00
Degree assortativity ρ =−0.302 389
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.357 196
Clustering coefficient c =0.001 555 42
Directed clustering coefficient c± =0.283 228
Spectral norm α =322.450
Operator 2-norm ν =325.124
Cyclic eigenvalue π =55.462 0
Algebraic connectivity a =0.066 392 9
Reciprocity y =0.123 460
Non-bipartivity bA =0.007 403 12
Normalized non-bipartivity bN =0.010 883 2
Spectral bipartite frustration bK =0.001 402 49


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 ]