Explosive dismantling of two-dimensional random lattices under betweenness centrality attacks
arXiv:2107.12779 · doi:10.1016/j.chaos.2021.111529
Abstract
In the present paper, we study the robustness of two-dimensional random lattices (Delaunay triangulations) under attacks based on betweenness centrality. Together with the standard definition of this centrality measure, we employ a range-limited approximation known as -betweenness, where paths having more than steps are ignored. For finite , the attacks produce continuous percolation transitions that belong to the universality class of random percolation. On the other hand, the attack under the full range betweenness induces a discontinuous transition that, in the thermodynamic limit, occurs after removing a sub-extensive amount of nodes. This behavior is recovered for -betweenness if the cutoff is allowed to scale with the linear length of the network faster than . Our results suggest that betweenness centrality encodes information on network robustness at all scales, and thus cannot be approximated using finite-ranged calculations without losing attack efficiency.
arXiv comment11 pages, 6 figures, supplementary material
References in corpus (29)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Catastrophic cascade of failures in interdependent networks
- Spatial Networks
- Influence maximization in complex networks through optimal percolation
- Consistency and differences between centrality measures across distinct classes of networks
- Explosive Phenomena in Complex Networks
- From the betweenness centrality in street networks to structural invariants in random planar graphs
- Explosive Percolation is Continuous, but with Unusual Finite Size Behavior
- Explosive percolation via control of the largest cluster
- Explosive Percolation: Novel critical and supercritical phenomena
- The critical probability for random Voronoi percolation in the plane is 1/2
- Construction and Analysis of Random Networks with Explosive Percolation
- Scaling behavior of explosive percolation on the square lattice
- Quenched Randomness at First-Order Transitions
- Percolation thresholds on 2D Voronoi networks and Delaunay triangulations
- Finite-size scaling theory for explosive percolation transitions
- Centrality scaling in large networks
- Two-Dimensional 8-State Potts Model on Random Lattices: A Monte Carlo Study
- The Harris-Luck criterion for random lattices
- Contact process on a Voronoi triangulation
- Phase Transitions on Random Lattices: How Random is Topological Disorder?
- Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks
- Critical Behavior of a Three-State Potts Model on a Voronoi Lattice
- The shape of shortest paths in random spatial networks
- Percolation thresholds on planar Euclidean relative neighborhood graphs
- Continuous and discontinuous absorbing-state phase transitions on Voronoi-Delaunay random lattices
- Explosive percolation in graphs
- Fragmentation properties of two-dimensional Proximity Graphs considering random failures and targeted attacks
- Method for estimating critical exponents in percolation processes with low sampling