Percolation of localized attack on complex networks

@article{Shao2014PercolationOL,
  title={Percolation of localized attack on complex networks},
  author={Shuai Shao and Xuqing Huang and Harry Eugene Stanley and Shlomo Havlin},
  journal={ArXiv},
  year={2014},
  volume={abs/1412.3124}
}
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 are neither random nor hub-targeted, but localized, where a group of neighboring nodes in a network are attacked and fail. In this paper we develop a percolation framework to analytically and numerically study the robustness of complex networks against such… Expand
Shell attack on interdependent networks
The robustness of networks suffering site or link attacks is a topic of great interest because it is an important issue affecting many real-world networks. The robustness of complex networks underExpand
Network Strengthening Against Malicious Attacks
TLDR
An algorithm to strengthen the robustness with reduced change of network structure compared to state-of-the-art algorithms is proposed, called targeted variable neighborhood search (TVNS) algorithm. Expand
Research on the Robustness of Interdependent Networks under Localized Attack
Critical infrastructures (CI) are the cornerstone of modern society, and they are connected with each other through material, energy, or information. The robustness of interdependent CI systems underExpand
Node differentiation protection concerning model of localized attack on real networks
TLDR
An adjusted localized attack process that breaks through the restriction of the structure of shells and considers node differentiation protection is proposed and constructed and applied to computer-generated and practical networks to observe its accuracy, the resilience of the networks, and the validity of the node protection pattern. Expand
Spreading of localized attacks in spatial multiplex networks
TLDR
A theory to predict the critical attack size is developed and found that it exhibits novel scaling behavior and it is found that localized attacks in these multiplex systems can induce a previously unobserved combination of random and spatial cascades. Expand
Subgraph Robustness of Complex Networks Under Attacks
  • Y. Shang
  • Computer Science
  • IEEE Transactions on Systems, Man, and Cybernetics: Systems
  • 2019
TLDR
By introducing the subgraph robustness problem, this work develops analytically a framework to investigate robustness properties of the two types of subgraphs under random attacks, localized attacks, and targeted attacks and finds that the benchmark models, such as Erdős-Rényi graphs, random regular networks, and scale-free networks possess distinct characteristic subgraph resilient features. Expand
Modified localized attack on complex network
TLDR
A generalization of the localized attack, modified localized attack is proposed, which means that when a randomly chosen node (root node) is under attack, protected nodes will not be removed, but unprotected nodes in the nearest shells will fail. Expand
Robustness analysis of interdependent networks under multiple-attacking strategies
Abstract The robustness of complex networks under attacks largely depends on the structure of a network and the nature of the attacks. Previous research on interdependent networks has focused on twoExpand
Attacking Mode Based on Shell Structure of Complex Networks
Previous research has focused on two types of initial attack: random attack and hub-targeted attack. However, in real scenarios, some system sometimes suffer from damage based on network shell. InExpand
Spreading of localized attacks in spatial multiplex networks
Many real-worldmultilayer systems such as critical infrastructure are interdependent and embedded in spacewith links of a characteristic length. They are also vulnerable to localized attacks orExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 67 REFERENCES
Robustness of interdependent networks under targeted attack
TLDR
It is found that when the highly connected nodes are protected and have lower probability to fail, in contrast to single scale-free (SF) networks where the percolation threshold pc = 0, coupled SF networks are significantly more vulnerable with pc significantly larger than zero. Expand
Breakdown of the internet under intentional attack.
TLDR
It is argued that, near criticality, the average distance between sites in the spanning (largest) cluster scales with its mass, M, as square root of [M], rather than as log (k)M, as expected for random networks away from criticality. Expand
Stability and topology of scale-free networks under attack and defense strategies.
TLDR
It is found that, for an intentional attack, little knowledge of the well-connected sites is sufficient to strongly reduce p(c), and at criticality, the topology of the network depends on the removal strategy, implying that different strategies may lead to different kinds of percolation transitions. Expand
Network robustness and fragility: percolation on random graphs.
TLDR
This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree. Expand
L-hop percolation on networks with arbitrary degree distributions and its applications.
TLDR
Using the generating functions approach, analytic results on the percolation threshold as well as the mean size, and size distribution, of nongiant components of complex networks under such operations are presented. Expand
Evolution of robust network topologies: Emergence of central backbones
TLDR
A block-based model is constructed which incorporates--in a general fashion--both connectivity and interdependence links, as well as arbitrary degree distributions and block correlations, and identifies a simple core-periphery structure as the topology most robust against random failure. Expand
Resilience of the internet to random breakdowns
TLDR
This work shows analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite, and finds that the physical structure of the Internet is impressively robust, with p(c)>0.99. Expand
Percolation of a general network of networks.
TLDR
An analytical framework and analysis of the percolation properties of a network composed of interdependent networks (NetONet) and the extremely vulnerable feedback condition of coupling are developed, where the coupling between nodes of different networks is not one-to-one correspondence. Expand
Spread of epidemic disease on networks.
  • M. Newman
  • Medicine, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
TLDR
This paper shows that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks. Expand
Catastrophic cascade of failures in interdependent networks
TLDR
This work develops a framework for understanding the robustness of interacting networks subject to cascading failures and presents exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks. Expand
...
1
2
3
4
5
...