A New Framework for Network Disruption
arXiv:1109.2954
Abstract
Traditional network disruption approaches focus on disconnecting or lengthening paths in the network. We present a new framework for network disruption that attempts to reroute flow through critical vertices via vertex deletion, under the assumption that this will render those vertices vulnerable to future attacks. We define the load on a critical vertex to be the number of paths in the network that must flow through the vertex. We present graph-theoretic and computational techniques to maximize this load, firstly by removing either a single vertex from the network, secondly by removing a subset of vertices.
Submitted for peer review on September 13, 2011
References in corpus (7)
- The structure and function of complex networks
- Cascade-based attacks on complex networks
- Attack vulnerability of complex networks
- A model for cascading failures in complex networks
- Growing Scale-Free Networks with Tunable Clustering
- Stability and topology of scale-free networks under attack and defense strategies
- Resilience of Complex Networks to Random Breakdown