Wikipedia links (zh-yue)

This network consists of the wikilinks of the Wikipedia in the Cantonese language (zh-yue). 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_zh_yue
NameWikipedia links (zh-yue)
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 =110,749
Volume m =1,718,542
Loop count l =73
Wedge count s =418,856,065
Claw count z =565,973,244,092
Cross count x =995,343,350,401,415
Triangle count t =24,329,606
Square count q =3,393,448,057
4-Tour count T4 =26,920,010,832
Maximum degree dmax =9,892
Maximum outdegree d+max =769
Maximum indegree dmax =9,366
Average degree d =31.034 9
Fill p =0.000 148 075
Size of LCC N =103,481
Size of LSCC Ns =58,072
Relative size of LSCC Nrs =0.560 449
Diameter δ =10
50-Percentile effective diameter δ0.5 =3.376 93
90-Percentile effective diameter δ0.9 =4.581 73
Mean distance δm =3.873 74
Gini coefficient G =0.791 840
Balanced inequality ratio P =0.177 373
Outdegree balanced inequality ratio P+ =0.193 059
Indegree balanced inequality ratio P =0.181 773
Relative edge distribution entropy Her =0.877 030
Power law exponent γ =1.562 53
Tail power law exponent γt =1.761 00
Degree assortativity ρ =−0.063 867 7
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.751 160
Clustering coefficient c =0.182 386
Directed clustering coefficient c± =0.607 672
Spectral norm α =532.345
Operator 2-norm ν =272.265
Cyclic eigenvalue π =260.084
Reciprocity y =0.520 418
Non-bipartivity bA =0.774 754
Normalized non-bipartivity bN =0.036 670 9
Spectral bipartite frustration bK =0.000 732 701


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 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 ]