Robustness of planar random graphs to targeted attacks

TL;DR

This study investigates the robustness of planar trivalent random graphs against targeted attacks, revealing their relative resilience and analyzing critical behavior through numerical simulations and percolation theory.

Contribution

It introduces a detailed numerical analysis of targeted attack resilience and compares nonrandom node removal effects to uniform percolation on these graphs.

Findings

Graphs are relatively robust to targeted attacks

Critical exponents align with uniform percolation

Targeted attacks modeled as non-uniform site percolation

Abstract

In this paper, robustness of planar trivalent random graphs to targeted attacks of highest connected nodes is investigated using numerical simulations. It is shown that these graphs are relatively robust. The nonrandom node removal process of targeted attacks is also investigated as a special case of non-uniform site percolation. Critical exponents are calculated by measuring various properties of the distribution of percolation clusters. They are found to be roughly compatible with critical exponents of uniform percolation on these graphs.