Percolation on a maximally disassortative network

Percolation on a maximally disassortative network
复制标题

DOI:
10.1209/0295-5075/128/46003
复制
发表时间:
2019-05
期刊:
Europhysics Letters
影响因子:
--
通讯作者:
S. Mizutaka;T. Hasegawa
S. Mizutaka;T. Hasegawa
中科院分区:
其他
文献类型:
--
作者:
S. Mizutaka;T. Hasegawa

文献摘要

相似文献

提出了一个实现最大负度-度关联的最大离散网络模型,并研究了该模型的渗流相变,讨论了强度-度关联对渗流临界行为的影响.利用二分网络的生成函数方法,我们解析地导出了逾渗阈值和序参量临界指数β。对于度分布为的MD无标度网络,我们证明了对于3$?>但不同的是。强的度-度相关性显著影响重尾无标度网络的渗流临界行为。我们的临界指数的分析结果在数值上证实了一个有限大小的标度参数。
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.