Stability of a Giant Connected Component in a Complex Network
Maksim Kitsak, Alexander A. Ganin, Daniel A. Eisenberg, Pavel L., Krapivsky, Dmitri Krioukov, David L. Alderson, and Igor Linkov

TL;DR
This paper investigates the stability of the largest connected component in complex networks under adverse events, revealing that single-layer networks with high-degree nodes are more stable, while interdependent networks tend to be less stable.
Contribution
It provides a novel analysis of how network topology affects the stability of the giant connected component under link failures.
Findings
High-degree nodes enhance robustness in single-layer networks.
Interdependent networks exhibit instability in their connected components.
Insights inform the design of more resilient network structures.
Abstract
We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network consists of the same nodes, regardless of the specific set of deactivated links. Our results are intuitive in the case of single-layered systems: the presence of large degree nodes in a single-layered network ensures both its robustness and stability. In contrast, we find that interdependent networks that are robust to adverse events have unstable connected components. Our results bring novel insights to the design of resilient network topologies and the reinforcement of existing networked systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
