Related papers: Breakdown of the Internet under intentional attack
Extensive researches have been dedicated to investigating the performance of real networks and synthetic networks against random failures or intentional attack guided by degree (degree attack). Degree is one of straightforward measures to…
When an initial failure of nodes occurs in interdependent networks, a cascade of failure between the networks occurs. Earlier studies focused on random initial failures. Here we study the robustness of interdependent networks under targeted…
Targeted immunization or attacks of large-scale networks has attracted significant attention by the scientific community. However, in real-world scenarios, knowledge and observations of the network may be limited thereby precluding a full…
Susceptibility of scale free Power Law (PL) networks to attacks has been traditionally studied in the context of what may be termed as {\em instantaneous attacks}, where a randomly selected set of nodes and edges are deleted while the…
Graphs are pervasive in our everyday lives, with relevance to biology, the internet, and infrastructure, as well as numerous other applications. It is thus necessary to have an understanding as to how quickly a graph disintegrates, whether…
Modeling how networks change under structural perturbations can yield foundational insights into network robustness, which is critical in many real-world applications. The largest connected component is a popular measure of network…
The study of network robustness focuses on the way the overall functionality of a network is affected as some of its constituent parts fail. Failures can occur at random or be part of an intentional attack and, in general, networks behave…
Modern large network systems normally work in cooperation and incorporate dependencies between their components for purposes of efficiency and regulation. Such dependencies may become a major risk since they can cause small scale failures…
In this paper we propose an alternative approach for the assessment of network vulnerability under random and intentional attacks as compared to the results obtained from the "vulnerability function" given by Criado et al. [Criado et al.…
Many networks are characterized by highly heterogeneous distributions of links, which are called scale-free networks and the degree distributions follow $p(k)\sim ck^{-\alpha}$. We study the robustness of scale-free networks to random…
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…
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second…
Using Monte Carlo simulations we calculate $f_c$, the fraction of nodes which are randomly removed before global connectivity is lost, for networks with scale-free and bimodal degree distributions. Our results differ with the results…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We propose a numerical method to evaluate the upper critical dimension $d_c$ of random percolation clusters in Erd\H{o}s-R\'{e}nyi networks and in scale-free networks with degree distribution ${\cal P}(k) \sim k^{-\lambda}$, where $k$ is…
Interconnected networks have been shown to be much more vulnerable to random and targeted failures than isolated ones, raising several interesting questions regarding the identification and mitigation of their risk. The paradigm to address…
Empirical estimation of critical points at which complex systems abruptly flip from one state to another is among the remaining challenges in network science. However, due to the stochastic nature of critical transitions it is widely…
We analyze the spreading of viruses in scale-free networks with high clustering and degree correlations, as found in the Internet graph. For the Suscetible-Infected-Susceptible model of epidemics the prevalence undergoes a phase transition…
We study cascading failures in smart grids, where an attacker selectively compromises the nodes with probabilities proportional to their degrees, betweenness, or clustering coefficient. This implies that nodes with high degrees,…
We study the behavior of scale-free networks, having connectivity distribution P(k) k^-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo a transition at a finite threshold of dilution, the…