Cascading failures constitute an important vulnerability of interconnected
systems. Here we focus on the study of such failures on networks in which the
connectivity of nodes is constrained by geographical distance. Specifically, we
use random geometric graphs as representative examples of such spatial
networks, and study the properties of cascading failures on them in the
presence of distributed flow. The key finding of this study is that the process
of cascading failures is non-self-averaging on spatial networks, and thus,
aggregate inferences made from analyzing an ensemble of such networks lead to
incorrect conclusions when applied to a single network, no matter how large the
network is. We demonstrate that this lack of self-averaging disappears with the
introduction of a small fraction of long-range links into the network. We
simulate the well studied preemptive node removal strategy for cascade
mitigation and show that it is largely ineffective in the case of spatial
networks. We introduce an altruistic strategy designed to limit the loss of
network nodes in the event of a cascade triggering failure and show that it
performs better than the preemptive strategy. Finally, we consider a real-world
spatial network viz. a European power transmission network and validate that
our findings from the study of random geometric graphs are also borne out by
simulations of cascading failures on the empirical network.
%0 Journal Article
%1 Asztalos2014Cascading
%A Asztalos, Andrea
%A Sreenivasan, Sameet
%A Szymanski, Boleslaw K.
%A Korniss, Gyorgy
%D 2014
%E Barrat, Alain
%J PLoS ONE
%K power\_grids, self-averaging, spatial-networks cascades lattice-models
%N 1
%P e84563+
%R 10.1371/journal.pone.0084563
%T Cascading Failures in Spatially-Embedded Random Networks
%U http://dx.doi.org/10.1371/journal.pone.0084563
%V 9
%X Cascading failures constitute an important vulnerability of interconnected
systems. Here we focus on the study of such failures on networks in which the
connectivity of nodes is constrained by geographical distance. Specifically, we
use random geometric graphs as representative examples of such spatial
networks, and study the properties of cascading failures on them in the
presence of distributed flow. The key finding of this study is that the process
of cascading failures is non-self-averaging on spatial networks, and thus,
aggregate inferences made from analyzing an ensemble of such networks lead to
incorrect conclusions when applied to a single network, no matter how large the
network is. We demonstrate that this lack of self-averaging disappears with the
introduction of a small fraction of long-range links into the network. We
simulate the well studied preemptive node removal strategy for cascade
mitigation and show that it is largely ineffective in the case of spatial
networks. We introduce an altruistic strategy designed to limit the loss of
network nodes in the event of a cascade triggering failure and show that it
performs better than the preemptive strategy. Finally, we consider a real-world
spatial network viz. a European power transmission network and validate that
our findings from the study of random geometric graphs are also borne out by
simulations of cascading failures on the empirical network.
@article{Asztalos2014Cascading,
abstract = {{Cascading failures constitute an important vulnerability of interconnected
systems. Here we focus on the study of such failures on networks in which the
connectivity of nodes is constrained by geographical distance. Specifically, we
use random geometric graphs as representative examples of such spatial
networks, and study the properties of cascading failures on them in the
presence of distributed flow. The key finding of this study is that the process
of cascading failures is non-self-averaging on spatial networks, and thus,
aggregate inferences made from analyzing an ensemble of such networks lead to
incorrect conclusions when applied to a single network, no matter how large the
network is. We demonstrate that this lack of self-averaging disappears with the
introduction of a small fraction of long-range links into the network. We
simulate the well studied preemptive node removal strategy for cascade
mitigation and show that it is largely ineffective in the case of spatial
networks. We introduce an altruistic strategy designed to limit the loss of
network nodes in the event of a cascade triggering failure and show that it
performs better than the preemptive strategy. Finally, we consider a real-world
spatial network viz. a European power transmission network and validate that
our findings from the study of random geometric graphs are also borne out by
simulations of cascading failures on the empirical network.}},
added-at = {2019-06-10T14:53:09.000+0200},
archiveprefix = {arXiv},
author = {Asztalos, Andrea and Sreenivasan, Sameet and Szymanski, Boleslaw K. and Korniss, Gyorgy},
biburl = {https://www.bibsonomy.org/bibtex/2781c080fefbcbe4922cbe7de80e77a82/nonancourt},
citeulike-article-id = {12614306},
citeulike-linkout-0 = {http://dx.doi.org/10.1371/journal.pone.0084563},
citeulike-linkout-1 = {http://arxiv.org/abs/1309.2175},
citeulike-linkout-2 = {http://arxiv.org/pdf/1309.2175},
day = 6,
doi = {10.1371/journal.pone.0084563},
editor = {Barrat, Alain},
eprint = {1309.2175},
interhash = {063b071ceda1e28526f5f51e47b3f044},
intrahash = {781c080fefbcbe4922cbe7de80e77a82},
issn = {1932-6203},
journal = {PLoS ONE},
keywords = {power\_grids, self-averaging, spatial-networks cascades lattice-models},
month = jan,
number = 1,
pages = {e84563+},
posted-at = {2013-09-10 11:33:32},
priority = {2},
timestamp = {2019-08-01T15:36:09.000+0200},
title = {{Cascading Failures in Spatially-Embedded Random Networks}},
url = {http://dx.doi.org/10.1371/journal.pone.0084563},
volume = 9,
year = 2014
}