Percolation on a maximally disassortative network
Percolation on a maximally disassortative network
复制标题
DOI:
10.1209/0295-5075/128/46003
复制
发表时间:
2019-05
期刊:
影响因子:
--
通讯作者:
S. Mizutaka;T. Hasegawa
中科院分区:
文献类型:
--
作者:
S. Mizutaka;T. Hasegawa
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation critical behaviors. Using the generating function method for bipartite networks, we analytically derive the percolation threshold and the order parameter critical exponent, β. For the MD scale-free networks, whose degree distribution is , we show that the exponent, β, for the MD networks and corresponding uncorrelated networks are the same for 3$ ?> but are different for . A strong degree-degree correlation significantly affects the percolation critical behavior in heavy-tailed scale-free networks. Our analytical results for the critical exponents are numerically confirmed by a finite-size scaling argument.