Browse
Submit Data
Databases
API
Help

Dataset Information

16 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Spatio-temporal propagation of cascading overload failures in spatially embedded networks.

ABSTRACT: Different from the direct contact in epidemics spread, overload failures propagate through hidden functional dependencies. Many studies focused on the critical conditions and catastrophic consequences of cascading failures. However, to understand the network vulnerability and mitigate the cascading overload failures, the knowledge of how the failures propagate in time and space is essential but still missing. Here we study the spatio-temporal propagation behaviour of cascading overload failures analytically and numerically on spatially embedded networks. The cascading overload failures are found to spread radially from the centre of the initial failure with an approximately constant velocity. The propagation velocity decreases with increasing tolerance, and can be well predicted by our theoretical framework with one single correction for all the tolerance values. This propagation velocity is found similar in various model networks and real network structures. Our findings may help to predict the dynamics of cascading overload failures in realistic systems.

SUBMITTER: Zhao J

PROVIDER: S-EPMC4729926 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Cascading failures in spatially-embedded random networks.

Project description: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.

| S-EPMC3882255 | biostudies-literature

Limits of Predictability of Cascading Overload Failures in Spatially-Embedded Networks with Distributed Flows.

Project description:Cascading failures are a critical vulnerability of complex information or infrastructure networks. Here we investigate the properties of load-based cascading failures in real and synthetic spatially-embedded network structures, and propose mitigation strategies to reduce the severity of damages caused by such failures. We introduce a stochastic method for optimal heterogeneous distribution of resources (node capacities) subject to a fixed total cost. Additionally, we design and compare the performance of networks with N-stable and (N-1)-stable network-capacity allocations by triggering cascades using various real-world node-attack and node-failure scenarios. We show that failure mitigation through increased node protection can be effectively achieved against single-node failures. However, mitigating against multiple node failures is much more difficult due to the combinatorial increase in possible sets of initially failing nodes. We analyze the robustness of the system with increasing protection, and find that a critical tolerance exists at which the system undergoes a phase transition, and above which the network almost completely survives an attack. Moreover, we show that cascade-size distributions measured in this region exhibit a power-law decay. Finally, we find a strong correlation between cascade sizes induced by individual nodes and sets of nodes. We also show that network topology alone is a weak predictor in determining the progression of cascading failures.

| S-EPMC5601003 | biostudies-literature

Mitigation of cascading failures in complex networks.

Project description:Cascading failures in many systems such as infrastructures or financial networks can lead to catastrophic system collapse. We develop here an intuitive, powerful and simple-to-implement approach for mitigation of cascading failures on complex networks based on local network structure. We offer an algorithm to select critical nodes, the protection of which ensures better survival of the network. We demonstrate the strength of our approach compared to various standard mitigation techniques. We show the efficacy of our method on various network structures and failure mechanisms, and finally demonstrate its merit on an example of a real network of financial holdings.

| S-EPMC7528121 | biostudies-literature

Universal behavior of cascading failures in interdependent networks.

Project description:Catastrophic and major disasters in real-world systems, such as blackouts in power grids or global failures in critical infrastructures, are often triggered by minor events which originate a cascading failure in interdependent graphs. We present here a self-consistent theory enabling the systematic analysis of cascading failures in such networks and encompassing a broad range of dynamical systems, from epidemic spreading, to birth-death processes, to biochemical and regulatory dynamics. We offer testable predictions on breakdown scenarios, and, in particular, we unveil the conditions under which the percolation transition is of the first-order or the second-order type, as well as prove that accounting for dynamics in the nodes always accelerates the cascading process. Besides applying directly to relevant real-world situations, our results give practical hints on how to engineer more robust networked systems.

| S-EPMC6842597 | biostudies-literature

Robustness of interrelated traffic networks to cascading failures.

Project description:The vulnerability to real-life networks against small initial attacks has been one of outstanding challenges in the study of interrelated networks. We study cascading failures in two interrelated networks S and B composed from dependency chains and connectivity links respectively. This work proposes a realistic model for cascading failures based on the redistribution of traffic flow. We study the Barabási-Albert networks (BA) and Erdős-Rényi graphs (ER) with such structure, and found that the efficiency sharply decreases with increasing percentages of the dependency nodes for removing a node randomly. Furthermore, we study the robustness of interrelated traffic networks, especially the subway and bus network in Beijing. By analyzing different attacking strategies, we uncover that the efficiency of the city traffic system has a non-equilibrium phase transition at low capacity of the networks. This explains why the pressure of the traffic overload is relaxed by singly increasing the number of small buses during rush hours. We also found that the increment of some buses may release traffic jam caused by removing a node of the bus network randomly if the damage is limited. However, the efficiencies to transfer people flow will sharper increase when the capacity of the subway network α(S) > α0.

| S-EPMC4067616 | biostudies-other

Cascading failures in bi-partite graphs: model for systemic risk propagation.

Project description:As economic entities become increasingly interconnected, a shock in a financial network can provoke significant cascading failures throughout the system. To study the systemic risk of financial systems, we create a bi-partite banking network model composed of banks and bank assets and propose a cascading failure model to describe the risk propagation process during crises. We empirically test the model with 2007 US commercial banks balance sheet data and compare the model prediction of the failed banks with the real failed banks after 2007. We find that our model efficiently identifies a significant portion of the actual failed banks reported by Federal Deposit Insurance Corporation. The results suggest that this model could be useful for systemic risk stress testing for financial systems. The model also identifies that commercial rather than residential real estate assets are major culprits for the failure of over 350 US commercial banks during 2008-2011.

| S-EPMC3564037 | biostudies-other

Study of Robustness in Functionally Identical Coupled Networks against Cascading Failures.

Project description:Based on coupled networks, taking node load, capacity and load redistribution between two networks into consideration, we propose functionally identical coupled networks, which consist of two networks connected by interlinks. Functionally identical coupled networks are derived from the power grid of the United States, which consists of many independent grids. Many power transmission lines are planned to interconnect those grids and, therefore, the study of the robustness of functionally identical coupled networks becomes important. In this paper, we find that functionally identical coupled networks are more robust than single networks under random attack. By studying the effect of the broadness and average degree of the degree distribution on the robustness of the network, we find that a broader degree distribution and a higher average degree increase the robustness of functionally identical coupled networks under random failure. And SF-SF (two coupled scale-free networks) is more robust than ER-ER (two coupled random networks) or SF-ER (coupled random network and scale-free network). This research is useful to construct robust functionally identical coupled networks such as two cooperative power grids.

| S-EPMC4975477 | biostudies-literature

Spatially embedded growing small-world networks.

Project description:Networks in nature are often formed within a spatial domain in a dynamical manner, gaining links and nodes as they develop over time. Motivated by the growth and development of neuronal networks, we propose a class of spatially-based growing network models and investigate the resulting statistical network properties as a function of the dimension and topology of the space in which the networks are embedded. In particular, we consider two models in which nodes are placed one by one in random locations in space, with each such placement followed by configuration relaxation toward uniform node density, and connection of the new node with spatially nearby nodes. We find that such growth processes naturally result in networks with small-world features, including a short characteristic path length and nonzero clustering. We find no qualitative differences in these properties for two different topologies, and we suggest that results for these properties may not depend strongly on the topology of the embedding space. The results do depend strongly on dimension, and higher-dimensional spaces result in shorter path lengths but less clustering.

| S-EPMC4231322 | biostudies-other

Cascading Failures in Interdependent Networks with Multiple Supply-Demand Links and Functionality Thresholds.

Project description:Various social, financial, biological and technological systems can be modeled by interdependent networks. It has been assumed that in order to remain functional, nodes in one network must receive the support from nodes belonging to different networks. So far these models have been limited to the case in which the failure propagates across networks only if the nodes lose all their supply nodes. In this paper we develop a more realistic model for two interdependent networks in which each node has its own supply threshold, i.e., they need the support of a minimum number of supply nodes to remain functional. In addition, we analyze different conditions of internal node failure due to disconnection from nodes within its own network. We show that several local internal failure conditions lead to similar nontrivial results. When there are no internal failures the model is equivalent to a bipartite system, which can be useful to model a financial market. We explore the rich behaviors of these models that include discontinuous and continuous phase transitions. Using the generating functions formalism, we analytically solve all the models in the limit of infinitely large networks and find an excellent agreement with the stochastic simulations.

| S-EPMC5678122 | biostudies-literature

Localized attacks on spatially embedded networks with dependencies.

Project description:Many real world complex systems such as critical infrastructure networks are embedded in space and their components may depend on one another to function. They are also susceptible to geographically localized damage caused by malicious attacks or natural disasters. Here, we study a general model of spatially embedded networks with dependencies under localized attacks. We develop a theoretical and numerical approach to describe and predict the effects of localized attacks on spatially embedded systems with dependencies. Surprisingly, we find that a localized attack can cause substantially more damage than an equivalent random attack. Furthermore, we find that for a broad range of parameters, systems which appear stable are in fact metastable. Though robust to random failures-even of finite fraction-if subjected to a localized attack larger than a critical size which is independent of the system size (i.e., a zero fraction), a cascading failure emerges which leads to complete system collapse. Our results demonstrate the potential high risk of localized attacks on spatially embedded network systems with dependencies and may be useful for designing more resilient systems.

| S-EPMC4355725 | biostudies-other

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data