Critical behaviors of high-degree adaptive and collective-influence percolation
arXiv:1911.08421 · doi:10.1063/1.5139454
Abstract
How the giant component of a network disappears under attacking nodes or links addresses a key aspect of network robustness, which can be framed into percolation problems. Various strategies to select the node to be deactivated have been studied in the literature; for instance, a simple random failure or high-degree adaptive (HDA) percolation. Recently a new attack strategy based on a quantity called collective-influence (CI) has been proposed from the perspective of optimal percolation. By successively deactivating the node having the largest CI-centrality value, it was shown to be able to dismantle a network more quickly and abruptly than many of the existing methods. In this paper, we focus on the critical behaviors of the percolation processes following degree-based attack and CI-based attack on random networks. Through extensive Monte Carlo simulations assisted by numerical solutions, we estimate various critical exponents of the HDA percolation and those of the CI percolations. Our results show that these attack-type percolation processes, despite displaying apparently more abrupt collapse, nevertheless exhibit standard mean-field critical behaviors at the percolation transition point. We further discover an extensive degeneracy in top-centrality nodes in both processes, which may provide a hint for understanding the observed results
arXiv comment6 pages, 4 figures
References in corpus (19)
- Error and attack tolerance of complex networks
- Random graphs with arbitrary degree distributions and their applications
- Identification of influential spreaders in complex networks
- Network robustness and fragility: Percolation on random graphs
- Attack vulnerability of complex networks
- Breakdown of the Internet under intentional attack
- Influence maximization in complex networks through optimal percolation
- Vital nodes identification in complex networks
- Network dismantling
- Generalized Network Dismantling
- Identifying optimal targets of network attack by belief propagation
- Fast and simple decycling and dismantling of networks
- Finite-size scaling in complex networks
- Immunization and targeted destruction of networks using explosive percolation
- Finding influential nodes for integration in brain networks using optimal percolation theory
- Efficient collective influence maximization in cascading processes with first-order transitions
- Model of Brain Activation Predicts the Neural Collective Influence Map of the Brain
- Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks
- Fragmentation properties of two-dimensional Proximity Graphs considering random failures and targeted attacks