Wikipedia links (hak)

This network consists of the wikilinks of the Wikipedia in the Hakka Chinese language (hak). 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_hak
NameWikipedia links (hak)
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 =11,487
Volume m =427,057
Loop count l =3
Wedge count s =42,775,768
Claw count z =16,799,003,841
Cross count x =1,978,291,241,430
Triangle count t =11,512,146
Square count q =1,669,651,210
4-Tour count T4 =13,493,514,948
Maximum degree dmax =1,443
Maximum outdegree d+max =270
Maximum indegree dmax =1,442
Average degree d =74.354 8
Fill p =0.003 375 25
Size of LCC N =11,442
Size of LSCC Ns =7,464
Relative size of LSCC Nrs =0.671 223
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.489 00
90-Percentile effective diameter δ0.9 =4.838 63
Median distance δM =4
Mean distance δm =4.001 45
Gini coefficient G =0.751 645
Balanced inequality ratio P =0.194 821
Outdegree balanced inequality ratio P+ =0.193 485
Indegree balanced inequality ratio P =0.211 829
Relative edge distribution entropy Her =0.882 573
Power law exponent γ =1.416 69
Tail power law exponent γt =1.421 00
Degree assortativity ρ =+0.154 136
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.772 068
Clustering coefficient c =0.807 383
Directed clustering coefficient c± =0.971 885
Spectral norm α =530.506
Operator 2-norm ν =265.506
Cyclic eigenvalue π =265.000
Algebraic connectivity a =0.064 514 4
Reciprocity y =0.775 843
Non-bipartivity bA =0.841 993
Normalized non-bipartivity bN =0.067 154 8
Spectral bipartite frustration bK =0.000 613 252


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 ]