一种计算互依网络中互连分量的有效算法
Efficient algorithm to compute mutually connected components in interdependent networks
摘要:
在相互依赖网络的研究中,相互连接组件(MCC)作为弹性的度量标准发挥着重要作用。尽管它们的重要性,一个有效的算法,以获得所有MCC的统计数据,在删除链接到目前为止还没有。在这里,使用一个众所周知的完全动态图算法,我们提出了一个有效的算法来完成这项任务。我们证明了该算法的时间复杂度约为$O({N^{1.2} })$的随机图,这是更有效的比$O(N^{2})$的暴力算法。我们确认我们的算法的正确性,通过比较的行为的序参量的链路被删除与现有的结果为三种类型的双层复用网络。我们预计,该算法将用于模拟以前无法访问的大型系统。
英文摘要:
Mutually connected components (MCCs) play an important role as a measure of resilience in the study of interdependent networks. Despite their importance, an efficient algorithm to obtain the statistics of all MCCs during the removal of links has thus far been absent. Here, using a well-known fully dynamic graph algorithm, we propose an efficient algorithm to accomplish this task. We show that the time complexity of this algorithm is approximately $O({N^{1.2} })$ for random graphs, which is more efficient than $O(N^{2})$ of the brute-force algorithm. We confirm the correctness of our algorithm by comparing the behavior of the order parameter as links are removed with existing results for three types of double-layer multiplex networks. We anticipate that this algorithm will be used for simulations of large-size systems that have been previously inaccessible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。