Explosive dismantling of two-dimensional random lattices under betweenness centrality attacks

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 $\ell$-betweenness, where paths having more than $\ell$ steps are ignored. For finite $\ell$, 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 $\ell$-betweenness if the cutoff is allowed to scale with the linear length of the network faster than $\ell \sim L^{0.91}$. 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.

11 pages, 6 figures, supplementary material

References in corpus (7)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Explosive Phenomena in Complex Networks
• Explosive percolation via control of the largest cluster
• Percolation thresholds on 2D Voronoi networks and Delaunay triangulations
• Contact process on a Voronoi triangulation
• Percolation thresholds on planar Euclidean relative neighborhood graphs
• Method for estimating critical exponents in percolation processes with low sampling