arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 0811.0850cond-mat.stat-mech
收藏

相同度序列无标度网络中键逾渗的不同阈值

Different thresholds of bond percolation in scale-free networks with identical degree sequence

Zhongzhi Zhang, Shuigeng Zhou, Tao Zou, Lichao Chen, Jihong Guan

摘要:

一般来说,复杂网络中的逾渗阈值取决于底层的结构特征。然而,拓扑性质起着主导作用仍然是未知的,尽管一些作者推测度分布是一个关键因素。本文的目的是表明幂律度分布本身并不足以表征无标度网络中键渗流的阈值。为了实现这一目标,我们首先提出了一族具有相同度序列的无标度网络,并通过解析或数值方法得到了这类网络的几个拓扑特征。然后,利用重整化群方法确定了网络中键渗流的阈值。我们发现了非零阈值的存在性,并证明了这些阈值可以是完全不同的,这意味着幂律度分布不足以表征无标度网络中的渗流阈值。

英文摘要:

Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that degree distribution is a key ingredient. The purpose of this paper is to show that power-law degree distribution itself is not sufficient to characterize the threshold of bond percolation in scale-free networks. To achieve this goal, we first propose a family of scale-free networks with the same degree sequence and obtain by analytical or numerical means several topological features of the networks. Then, by making use of the renormalization group technique we determine the threshold of bond percolation in our networks. We find an existence of non-zero thresholds and demonstrate that these thresholds can be quite different, which implies that power-law degree distribution does not suffice to characterize the percolation threshold in scale-free networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑