Wikipedia links (gan)

This network consists of the wikilinks of the Wikipedia in the Gan Chinese language (gan). 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

CodeWgan
Internal namewikipedia_link_gan
NameWikipedia links (gan)
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 =9,189
Volume m =176,051
Loop count l =3
Wedge count s =13,262,264
Claw count z =4,198,901,292
Cross count x =1,209,064,095,872
Triangle count t =1,693,648
Square count q =123,755,756
4-Tour count T4 =1,043,323,312
Maximum degree dmax =2,078
Maximum outdegree d+max =360
Maximum indegree dmax =2,073
Average degree d =38.317 8
Fill p =0.002 084 98
Size of LCC N =9,092
Size of LSCC Ns =5,195
Relative size of LSCC Nrs =0.565 350
Diameter δ =12
50-Percentile effective diameter δ0.5 =3.596 14
90-Percentile effective diameter δ0.9 =5.051 26
Median distance δM =4
Mean distance δm =4.115 63
Gini coefficient G =0.684 063
Balanced inequality ratio P =0.241 390
Outdegree balanced inequality ratio P+ =0.267 360
Indegree balanced inequality ratio P =0.240 175
Relative edge distribution entropy Her =0.901 052
Power law exponent γ =1.466 16
Tail power law exponent γt =2.341 00
Tail power law exponent with p γ3 =2.341 00
p-value p =0.000 00
Outdegree tail power law exponent with p γ3,o =2.731 00
Outdegree p-value po =0.000 00
Indegree tail power law exponent with p γ3,i =2.021 00
Indegree p-value pi =0.000 00
Degree assortativity ρ =−0.073 063 0
Degree assortativity p-value pρ =1.315 06 × 10−267
In/outdegree correlation ρ± =+0.844 728
Clustering coefficient c =0.383 113
Directed clustering coefficient c± =0.709 695
Operator 2-norm ν =133.136
Cyclic eigenvalue π =124.678
Reciprocity y =0.703 722
Normalized non-bipartivity bN =0.024 954 0
Algebraic non-bipartivity χ =0.045 368 0
Spectral bipartite frustration bK =0.000 452 097
Controllability C =3,134
Relative controllability Cr =0.341 060

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 ]