基于自然连通度的随机图的鲁棒性
Robustness of Random Graphs Based on Natural Connectivity
摘要:
近年来,人们提出利用自然连通性来有效地增强复杂网络的鲁棒性。自然连通度通过计算所有长度的封闭路径的加权数量来量化网络中替代路径的冗余度,并且可以被视为从图谱中获得的平均特征值。在这篇文章中,我们探讨了随机图的自然连通性的分析和数值,并表明它与平均度线性增加。通过与正则环格和随机正则图的比较,我们证明了随机图比随机正则图具有更好的鲁棒性,但是随机图与正则环格的关系依赖于平均度和图的大小.我们得到的临界图的大小作为一个函数的平均度,这可以预测我们的分析结果。当图的大小小于临界值时,随机图比规则环格更鲁棒,而当图的大小大于临界值时,规则环格比随机图更鲁棒.
英文摘要:
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the weighted number of closed walks of all lengths and can be regarded as the average eigenvalue obtained from the graph spectrum. In this article, we explore the natural connectivity of random graphs both analytically and numerically and show that it increases linearly with the average degree. By comparing with regular ring lattices and random regular graphs, we show that random graphs are more robust than random regular graphs; however, the relationship between random graphs and regular ring lattices depends on the average degree and graph size. We derive the critical graph size as a function of the average degree, which can be predicted by our analytical results. When the graph size is less than the critical value, random graphs are more robust than regular ring lattices, whereas regular ring lattices are more robust than random graphs when the graph size is greater than the critical value.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。