Explosive dismantling of twodimensional random lattices under betweenness centrality attacks
Abstract
In the present paper, we study the robustness of twodimensional random lattices (Delaunay triangulations) under attacks based on betweenness centrality. Together with the standard definition of this centrality measure, we employ a rangelimited 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 subextensive 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 ℓ ∼L^{0.91} . Our results suggest that betweenness centrality encodes information on network robustness at all scales, and thus cannot be approximated using finiteranged calculations without losing attack efficiency.
 Publication:

Chaos Solitons and Fractals
 Pub Date:
 December 2021
 DOI:
 10.1016/j.chaos.2021.111529
 arXiv:
 arXiv:2107.12779
 Bibcode:
 2021CSF...15311529A
 Keywords:

 Complex networks;
 Explosive percolation;
 Betweenness;
 Condensed Matter  Statistical Mechanics;
 Physics  Computational Physics
 EPrint:
 11 pages, 6 figures, supplementary material