Wikipedia links (cdo)

This network consists of the wikilinks of the Wikipedia in the Min Dong Chinese language (cdo). 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_cdo
NameWikipedia links (cdo)
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 =14,589
Volume m =299,026
Loop count l =13
Wedge count s =49,940,908
Claw count z =33,039,801,721
Cross count x =17,637,696,719,756
Triangle count t =4,629,452
Square count q =755,286,833
4-Tour count T4 =6,242,456,270
Maximum degree dmax =3,367
Maximum outdegree d+max =270
Maximum indegree dmax =3,307
Average degree d =40.993 4
Fill p =0.001 404 94
Size of LCC N =14,574
Size of LSCC Ns =8,961
Relative size of LSCC Nrs =0.614 230
Diameter δ =307
50-Percentile effective diameter δ0.5 =3.469 99
90-Percentile effective diameter δ0.9 =5.941 26
Median distance δM =4
Mean distance δm =7.534 89
Gini coefficient G =0.695 955
Relative edge distribution entropy Her =0.888 234
Power law exponent γ =1.427 55
Tail power law exponent γt =2.581 00
Degree assortativity ρ =−0.120 085
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.815 615
Clustering coefficient c =0.278 096
Directed clustering coefficient c± =0.917 537
Spectral norm α =530.508
Operator 2-norm ν =265.504
Cyclic eigenvalue π =265.004
Algebraic connectivity a =5.534 66 × 10−5
Reciprocity y =0.669 056
Non-bipartivity bA =0.794 461
Normalized non-bipartivity bN =1.371 52 × 10−5
Spectral bipartite frustration bK =5.472 47 × 10−6


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 ]