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.

Metadata

CodeWcdo
Internal namewikipedia_link_cdo
NameWikipedia links (cdo)
Data sourcehttp://dumps.wikimedia.org/
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Category
Hyperlink network
Node meaningArticle
Edge meaningWikilink
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops

Statistics

Size n =14,816
Volume m =306,031
Loop count l =14
Wedge count s =55,328,986
Claw count z =37,170,628,587
Cross count x =20,045,136,755,172
Triangle count t =4,682,380
Square count q =761,007,483
4-Tour count T4 =6,309,785,364
Maximum degree dmax =3,370
Maximum outdegree d+max =270
Maximum indegree dmax =3,309
Average degree d =41.310 9
Fill p =0.001 394 13
Size of LCC N =14,798
Size of LSCC Ns =9,109
Relative size of LSCC Nrs =0.614 808
Diameter δ =307
50-Percentile effective diameter δ0.5 =3.445 08
90-Percentile effective diameter δ0.9 =12.019 2
Median distance δM =4
Mean distance δm =8.880 11
Gini coefficient G =0.695 905
Balanced inequality ratio P =0.246 299
Outdegree balanced inequality ratio P+ =0.276 247
Indegree balanced inequality ratio P =0.226 745
Relative edge distribution entropy Her =0.887 674
Power law exponent γ =1.427 15
Tail power law exponent γt =2.631 00
Tail power law exponent with p γ3 =2.631 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =2.141 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.101 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.132 479
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =+0.816 976
Clustering coefficient c =0.253 884
Directed clustering coefficient c± =0.915 369
Spectral norm α =530.508
Operator 2-norm ν =265.504
Cyclic eigenvalue π =265.004
Algebraic connectivity a =5.533 24 × 10−5
Spectral separation 1[A] / λ2[A]| =2.086 88
Reciprocity y =0.661 672
Non-bipartivity bA =0.794 734
Normalized non-bipartivity bN =1.371 52 × 10−5
Algebraic non-bipartivity χ =0.000 245 456
Spectral bipartite frustration bK =2.217 18 × 10−6
Controllability C =5,458
Relative controllability Cr =0.368 386

Plots

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

SynGraphy

Matrix decompositions plots

Downloads

References

[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]