Baidu related
These are "related to" links between articles of the Chinese online
encyclopedia Baidu (百度百科, http://baike.baidu.com/). The graph does
contain 52 instances of duplicate edge pairs, i.e., two directed edges between
the same two nodes, with the same orientation. We do not know whether these 52
pairs are an error in the extraction of the network, or represent cases where a
pages is specified multiple times as a related page for a given page. In any
case, the duplicates were not removed from the dataset, and hence this is a
network with multiple edges.
Metadata
Statistics
Size | n = | 415,641
|
Volume | m = | 3,284,387
|
Unique edge count | m̿ = | 3,284,335
|
Loop count | l = | 18
|
Wedge count | s = | 64,694,677,166
|
Claw count | z = | 2,731,400,041,814,389
|
Cross count | x = | 8.672 01 × 1019
|
Triangle count | t = | 14,287,651
|
Square count | q = | 235,529,921,685
|
4-Tour count | T4 = | 2,143,022,830,232
|
Maximum degree | dmax = | 127,090
|
Maximum outdegree | d+max = | 426
|
Maximum indegree | d−max = | 127,035
|
Average degree | d = | 15.804 0
|
Fill | p = | 1.901 13 × 10−5
|
Average edge multiplicity | m̃ = | 1.000 02
|
Size of LCC | N = | 372,840
|
Size of LSCC | Ns = | 208,222
|
Relative size of LSCC | Nrs = | 0.500 966
|
Diameter | δ = | 32
|
50-Percentile effective diameter | δ0.5 = | 5.699 48
|
90-Percentile effective diameter | δ0.9 = | 8.538 50
|
Median distance | δM = | 6
|
Mean distance | δm = | 6.109 45
|
Gini coefficient | G = | 0.640 156
|
Balanced inequality ratio | P = | 0.258 736
|
Outdegree balanced inequality ratio | P+ = | 0.328 845
|
Indegree balanced inequality ratio | P− = | 0.206 672
|
Tail power law exponent | γt = | 2.601 00
|
Tail power law exponent with p | γ3 = | 2.601 00
|
p-value | p = | 0.000 00
|
Outdegree tail power law exponent with p | γ3,o = | 2.651 00
|
Outdegree p-value | po = | 0.000 00
|
Indegree tail power law exponent with p | γ3,i = | 2.741 00
|
Indegree p-value | pi = | 0.000 00
|
Degree assortativity | ρ = | −0.274 014
|
Degree assortativity p-value | pρ = | 0.000 00
|
Clustering coefficient | c = | 0.000 662 542
|
Directed clustering coefficient | c± = | 0.311 056
|
Operator 2-norm | ν = | 1,007.86
|
Cyclic eigenvalue | π = | 167.975
|
Algebraic connectivity | a = | 0.001 359 15
|
Spectral separation | |λ1[A] / λ2[A]| = | 1.000 99
|
Reciprocity | y = | 0.554 317
|
Non-bipartivity | bA = | 0.000 992 180
|
Normalized non-bipartivity | bN = | 0.000 756 745
|
Algebraic non-bipartivity | χ = | 0.009 116 32
|
Spectral bipartite frustration | bK = | 0.000 183 288
|
Controllability | C = | 178,854
|
Relative controllability | Cr = | 0.430 309
|
Plots
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 ]
|
[2]
|
Xing Niu, Xinruo Sun, Haofen Wang, Shu Rong, Guilin Qi, and Yong Yu.
Zhishi.me – weaving Chinese linking open data.
In Proc. Int. Semant. Web Conf., pages 205–220, 2011.
|