15.05.2026 | Network Robustness
A cybersecurity expert is evaluating the vulnerabilities of a communication grid mapped as a scale-free network. He observes that while the grid survives random router failures effortlessly, it collapses quickly when a very small fraction of specific high-degree routers is targeted. What explains this behavior? A) Targeted attacks uniquely decrease the minimum degree of the network, causing a cascading failure among low-degree nodes. B) Targeted attacks on scale-free networks automatically convert their topology into a random Erdos-Renyi network, which cannot sustain a giant component . C) The attack threshold ( $f_c$ ) for scale-free networks is theoretically proven to be higher than the threshold for random failures . D) Removing a fraction of the hubs significantly lowers the maximum degree of the network and alters the degree distribution, meaning that even removing a tiny fraction of hubs can destroy the network . E) None of the above. Original idea by: Yuri S. Costa