Cascade-based attacks on complex networks.

@article{Motter2002CascadebasedAO,
  title={Cascade-based attacks on complex networks.},
  author={Adilson E. Motter and Ying-Cheng Lai},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2002},
  volume={66 6 Pt 2},
  pages={
          065102
        }
}
  • A. Motter, Y. Lai
  • Published 2002
  • Computer Science, Physics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized by the loads on nodes, is important. We show that for such networks where loads can redistribute among the nodes, intentional attacks can lead to a cascade of overload failures, which can in turn cause the entire or a substantial part of the network to… Expand
Attacks and cascades in weighted scale-free networks
Large cascading failures are present in most of infrastructure networks. This paper reviews the problem of cascades of overload failures on nodes in the security of complex networks. Here we proposeExpand
Bottleneck Attack Strategies on Complex Communication Networks
TLDR
Simulation results indicate that hub-bottlenecks, rather than hub-nonbottlenECks, are most important in all networks, and bottleneck nodes represent the fragility of modular scale-free networks. Expand
Attacks and cascades in complex networks
This paper reviews two problems in the security of complex networks: cas- cades of overload failures on nodes and range-based attacks on links. Cascading failures have been reported for numerousExpand
Attack Vulnerability of Complex Communication Networks
TLDR
Compared with the classic random graph and scale-free network models, the congestion control protocols are considered so that the bandwidth can be reallocated among flows and cascading breakdown is less likely to happen. Expand
Robustness of Internet under targeted attack: A cascading failure perspective
TLDR
Considering two types of nodes, a new cascading edge model is proposed and investigated to investigate the cascading dynamic behaviors in the Internet and find that the Internet displays the stronger robust level under two targeted attacks. Expand
Inhibiting failure spreading in complex networks
TLDR
This article rigorously proves the existence of certain subgraphs, called network isolators, that can completely inhibit any failure spreading, and shows how to create such isolators in synthetic and real-world networks. Expand
Cascading Critical Nodes Detection with Load Redistribution in Complex Systems
TLDR
The first approach estimates the cascading potential of each node while the second one measures the cooperated impact of node failures under an ordered attack to solve the problem of complex network vulnerability under cascading failure. Expand
Identifying Vulnerable Nodes of Complex Networks in Cascading Failures Induced by Node-Based Attacks
In the research on network security, distinguishing the vulnerable components of networks is very important for protecting infrastructures systems. Here, we probe how to identify the vulnerable nodesExpand
Recent advances on failure and recovery in networks of networks
TLDR
A review of the framework developed in recent years for studying the vulnerability and recovery of networks composed of inter dependent networks and the analytical solutions for the critical threshold and the giant component of a network of n interdependent networks are presented. Expand
Scale-Free Networks and Robustness of Critical Infrastructure Networks
We examine the robustness of critical infrastructure networks, specifically aspects which relate to the network topology. We describe some simulation studies which identify a number ofExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 47 REFERENCES
Small worlds: the dynamics of networks between order and randomness
  • Jie Wu
  • Computer Science
  • SGMD
  • 2002
Everyone knows the small-world phenomenon: soon after meeting a stranger, we are surprised to discover that we have a mutual friend, or we are connected through a short chain of acquaintances. In hisExpand
Small Worlds: The Dynamics of Networks between Order and Randomness
small worlds the dynamics of networks between order and. download small worlds the dynamics of networks between. small worlds and the dynamics of networks. small world networks oxford handbooks.Expand
Phys
  • Rev. Lett. 88, 108701
  • 2002
Proc
  • Natl. Acad. Sci. U.S.A. 99, 2573
  • 2002
Ph ys
  • Rev. Lett. 87, 258701
  • 2001
Nature (London ) 406
  • 378
  • 2000
A
  • Dı́as-Guilera, and F. Giralt , Phys. Rev. E66, 026704
  • 2002
Europhys
  • Let t. 58, 630
  • 2002
Phys
  • Rev. E 65, 056109
  • 2002
Phys
  • Rev. E 66, 065103
  • 2002
...
1
2
3
4
5
...