Efficient algorithm to compute mutually connected components in interdependent networks.
TL;DR: This work proposes an efficient algorithm to obtain the statistics of all MCCs during the removal of links using a well-known fully dynamic graph algorithm, and shows 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.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
FIG. 2. (Color online) Plot of P∞ (the size of a giant MCC divided by N) vs the mean degree k = 2L/N , where L is the number of remaining links in the system. N = 106 and an initial mean degree k0 = 4 are taken. As links are removed randomly one by one from each layer, P∞ exhibits various discontinuous or continuous transitions depending on the underlying networks. 
FIG. 3. (Color online) (a) Plot of s (the number of MCCs divided by the system size N) vs the mean degree k under the same conditions as those in Fig. 2. s exhibits behavior similar to m but in an upside-down manner for complex networks. (b) However, s exhibits a somewhat different behavior from m for the two-dimensional lattices. 
FIG. 5. (Color online) (a) The tree we want to represent. (b) An Euler tour sequence from node C of the tree. (c) The sequence stored in a balanced tree. The number next to each node of (c) is the size of the subtree from the node. 
FIG. 1. (a) Initial configurations of A-layer (upper) and B-layer (lower) networks. (b) First, each connected component is maintained in a spanning tree form. Link D–F (gray line) in the A layer is treated as a redundant link. Second, ad hoc links (dashed lines) B–D in the A layer and A–B in the B layer are added between two nodes through randomly selection from each component to connect the networks. Then, there is only one MCC and all links including the ad hoc links are active (thick lines). (c) An ad hoc link B–D is deleted in the A layer. This deletion splits the A-network into two components. Subsequently, link A–E in the B layer becomes inactive (thin line) and we identify two MCCs {A, B, C} and {D, E, F}. (d) The other ad hoc link A–B in the B layer is deleted. Subsequently, link A–B in the A layer becomes inactive (thin line) and the component {A, B, C} is split into two components {A, C} and {B}. At this stage, there are no remaining ad hoc links and the MCCs (represented by different node symbols) of the networks in (a) have been retained with identification of active and inactive links. (e) Now we delete links in the original networks one by one in the same manner. Here we show two examples of link deletion that do not cause a cascade of inactivations: (i) link E–D deletion in the A layer and (ii) link A–E deletion in the B layer. For case (i) the redundant link D–F is recovered and maintains the spanning tree. For case (ii), because the link is inactive, nothing occurs.
Citations
疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
18.9K
Percolation in real interdependent networks
TL;DR: Reducing the interconnected networks to a set of decoupled graphs provides a route to probing finite sizes in multi-layered networks.
226
Percolation on complex networks: Theory and application
TL;DR: Understanding the percolation theory should help the study of many fields in network science, including the still opening questions in the frontiers of networks, such as networks beyond pairwise interactions, temporal networks, and network of networks.
206
•Journal Article
Percolation in real interdependent networks
TL;DR: In this article, the authors propose to reduce the interconnected networks to a set of decoupled graphs, which provides a route to probing finite sizes, and they show that decoupling networks can be used to study how catastrophe propagates in multi-layered networks.
177
Towards real-world complexity: an introduction to multiplex networks
TL;DR: An organized review of the growing body of current literature on multiplex networks by categorizing existing studies broadly according to the type of layer coupling in the problem.
159
References
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
39.1K
疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
18.9K
IL-13受体α2降低血吸虫病肉芽肿的炎症反应并延长宿主存活时间[英]/Mentink-Kane MM,Cheever AW，Thompson RW，et al//Proc Natl Acad Sci U S A
TL;DR: 曼氏血吸虫感染后，宿主活化CD4^＋Th2细胞Ｌ分泌IL-4、IL-5和 IL-13。
11.2K
Introduction to Algorithms
Xin-She Yang
- 01 Jan 2014
TL;DR: This chapter provides an overview of the fundamentals of algorithms and their links to self-organization, exploration, and exploitation.
8.3K