Related papers: Breakdown of the Internet under intentional attack

How the giant component of a network disappears under attacking nodes or links addresses a key aspect of network robustness, which can be framed into percolation problems. Various strategies to select the node to be deactivated have been…

Clustering, or transitivity has been observed in real networks and its effects on their structure and function has been discussed extensively. The focus of these studies has been on clustering of single networks while the effect of…

Spreading of either information or matter can often be treated as a network problem. It can be of great importance to be able to estimate the likelihood that spreading through a network reaches essentially the entire network while still not…

An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a…

We study the resilience of complex networks against attacks in which nodes are targeted intelligently, but where disabling a node has a cost to the attacker which depends on its degree. Attackers have to meet these costs with limited…

A central issue in complex networks is tolerance to random failures and intentional attacks. Current literature emphasizes the dichotomy between networks with a power-law node connectivity distribution, which are robust to random failures…

Scale-free networks with small power law exponent are known to be robust, meaning that their qualitative topological structure cannot be altered by random removal of even a large proportion of nodes. By contrast, it has been argued in the…

It was recently found that cascading failures can cause the abrupt breakdown of a system of interdependent networks. Using the percolation method developed for single clustered networks by Newman [Phys. Rev. Lett. {\bf 103}, 058701 (2009)],…

Network structures in a wide array of systems such as social networks, transportation, power and water distribution infrastructures, and biological and ecological systems can exhibit critical thresholds or tipping points beyond which there…

Many real networks present a bounded scale-free behavior with a connectivity cut-off due to physical constraints or a finite network size. We study epidemic dynamics in bounded scale-free networks with soft and hard connectivity cut-offs.…

Whether as telecommunications or power systems, networks are very important in everyday life. Maintaining these networks properly functional and connected, even under attacks or failures, is of special concern. This topic has been…

All possible removals of $n=5$ nodes from networks of size $N=100$ are performed in order to find the optimal set of nodes which fragments the original network into the smallest largest connected component. The resulting attacks are ordered…

A detailed analysis of three species-rich ecosystem food webs has shown that they display scale-free distributions of connections. Such graphs of interaction are in fact shared by a number of biological and technological networks, which…

Adversarial attacks have been alerting the artificial intelligence community recently, since many machine learning algorithms were found vulnerable to malicious attacks. This paper studies adversarial attacks to scale-free networks to test…

We systematically study and compare damage spreading for random Boolean and threshold networks under small external perturbations (damage), a problem which is relevant to many biological networks. We identify a new characteristic…

The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they…

We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…

This study examines the robustness of I2P, a well-regarded anonymous and decentralized peer-to-peer network designed to ensure anonymity, confidentiality, and circumvention of censorship. Unlike its more widely researched counterpart, TOR,…

Despite great effort spent measuring topological features of large networks like the Internet, it was recently argued that sampling based on taking paths through the network (e.g., traceroutes) introduces a fundamental bias in the observed…

The robustness of complex networks against node failure and malicious attack has been of interest for decades, while most of the research has focused on random attack or hub-targeted attack. In many real-world scenarios, however, attacks…