Unveiling Explosive Vulnerability of Networks through Edge Collective Behavior
Abstract: Edges, binding together nodes within networks, have the potential to induce dramatic transitions when specific collective failure behaviors emerge. These changes, initially unfolding covertly and then erupting abruptly, pose substantial, unforeseeable threats to networked systems, and are termed explosive vulnerability. Thus, identifying influential edges capable of triggering such drastic transitions, while minimizing cost, is of utmost significance. Here, we address this challenge by introducing edge collective influence (ECI), which builds upon the optimal percolation theory applied to line graphs. ECI embodies features of both optimal and explosive percolation, involving minimized removal costs and explosive dismantling tactic. Furthermore, we introduce two improved versions of ECI, namely IECI and IECIR, tailored for objectives of hidden and fast dismantling, respectively, with their superior performance validated in both synthetic and empirical networks. Finally, we present a dual competitive percolation (DCP) model, whose reverse process replicates the explosive dismantling process and the trajectory of the cost function of ECI, elucidating the microscopic mechanisms enabling ECI's optimization. ECI and the DCP model demonstrate the profound connection between optimal and explosive percolation. This work significantly deepens our comprehension of percolation and provides valuable insights into the explosive vulnerabilities arising from edge collective behaviors.
- Complex networks: Structure and dynamics. Physics Reports, 424(4):175–308, 2006.
- The Structure and Dynamics of Networks. Princeton University Press, 2011.
- Explosive Phenomena in Complex Networks. Advances in Physics, 68(3):123–223, 2019.
- Percolation on complex networks: Theory and application. Physics Reports, 907:1–68, 2021.
- Percolation in Spatial Networks: Spatial Network Models Beyond Nearest Neighbours Structures. Elements in the Structure and Dynamics of Complex Networks, 2022.
- Network dismantling. Proceedings of the National Academy of Sciences, 113(44):12368–12373, 2016.
- Generalized network dismantling. Proceedings of the National Academy of Sciences, 116(14):6554–6559, 2019.
- Small vulnerable sets determine large network cascades in power grids. Science, 358(6365):eaan3184, 2017.
- Dynamically induced cascading failures in power grids. Nature Communications, 9(1):1975, 2018.
- Fundamental difference between superblockers and superspreaders in networks. Physical Review E, 95(1):012318, 2017.
- Containing Epidemic Outbreaks by Message-Passing Techniques. Physical Review X, 4(2):021024, 2014.
- Influence maximization in complex networks through optimal percolation. Nature, 524(7563):65–68, 2015.
- Immunization and Targeted Destruction of Networks using Explosive Percolation. Physical Review Letters, 117(20):208301, 2016.
- Identifying optimal targets of network attack by belief propagation. Physical Review E, 94(1):012305, 2016.
- Fast and simple decycling and dismantling of networks. Scientific Reports, 6(1):37954, 2016.
- Articulation points in complex networks. Nature Communications, 8(1):14223, 2017.
- Optimization of targeted node set in complex networks under percolation and selection. Physical Review E, 98(1):012313, 2018.
- Finding key players in complex networks through deep reinforcement learning. Nature Machine Intelligence, 2:1–8, 2020.
- Machine learning dismantling and early-warning signals of disintegration in complex systems. Nature Communications, 12(1):5190, 2021.
- Explosive Percolation in Random Networks. Science, 323(5920):1453–1455, 2009.
- Explosive Percolation via Control of the Largest Cluster. Physical Review Letters, 105(3):035701, 2010.
- Explosive Percolation Transition is Actually Continuous. Physical Review Letters, 105(25):255701, 2010.
- Explosive Percolation Is Continuous. Science, 333(6040):322–324, 2011.
- A universal route to explosive phenomena. Science Advances, 7(16):eabe3824, 2021.
- Modeling Explosive Opinion Depolarization in Interdependent Topics. Physical Review Letters, 130(20):207401, 2023.
- Explosive higher-order Kuramoto dynamics on simplicial complexes. Physical Review Letters, 124(21):218301, 2020.
- Synchrony for Weak Coupling in the Complexified Kuramoto Model. Physical Review Letters, 130(18):187201, 2023.
- Hanlin Sun. Higher-order percolation processes on multiplex hypergraphs. Physical Review E, 104(3), 2021.
- The dynamic nature of percolation on networks with triadic interactions. Nature Communications, 14(1):1308, 2023.
- The physics of higher-order interactions in complex systems. Nature Physics, 17(10):1093–1098, 2021.
- Inverse targeting—an effective immunization strategy. Europhysics Letters, 98(4):46002, 2012.
- Impact of single links in competitive percolation. Nature Physics, 7(3):265–270, 2011.
- Bridgeness: A Local Index on Edge Significance in Maintaining Global Connectivity. Journal of Statistical Mechanics: Theory and Experiment, 2010(10):P10011, 2010.
- Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12):7821–7826, 2002.
- Mark Newman. Networks. Oxford university press, 2018.
- Emergence of scaling in random networks. Science, 286(5439):509–512, 1999.
- The Network Data Repository with Interactive Graph Analytics and Visualization. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1), 2015.
- M. E. J. Newman. Message passing methods on complex networks. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 479(2270):20220774, 2023.
- Some spectral properties of the non-backtracking matrix of a graph. Linear Algebra and its Applications, 618:37–57, 2021.
- Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications, 272(1):173–187, 1999.
- Construction and Analysis of Random Networks with Explosive Percolation. Physical Review Letters, 103(25):255701, 2009.
- Mitigation of malicious attacks on networks. Proceedings of the National Academy of Sciences, 108(10):3838–3841, 2011.
- Some properties of line digraphs. Rendiconti del Circolo Matematico di Palermo, 9:161–168, 1960.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.