skip to main content

Title: Nonlinear model of cascade failure in weighted complex networks considering overloaded edges
Abstract

Considering the elasticity of the real networks, the components in the network have a redundant capacity against the load, such as power grids, traffic networks and so on. Moreover, the interaction strength between nodes is often different. This paper proposes a novel nonlinear model of cascade failure in weighted complex networks considering overloaded edges to describe the redundant capacity for edges and capture the interaction strength of nodes. We fill this gap by studying a nonlinear weighted model of cascade failure with overloaded edges over synthetic and real weighted networks. The cascading failure model is constructed for the first time according to the overload coefficient, capacity parameter, weight coefficient, and distribution coefficient. Then through theoretical analysis, the conditions for stopping failure cascades are obtained, and the analysis shows the superiority of the constructed model. Finally, the cascading invulnerability is simulated in several typical network models and the US power grid. The results show that the model is a feasible and reasonable change of weight parameters, capacity coefficient, distribution coefficient, and overload coefficient can significantly improve the destructiveness of complex networks against cascade failure. Our methodology provides an efficacious reference for the control and prevention of cascading failures in many more » real networks.

« less
Authors:
; ; ;
Publication Date:
NSF-PAR ID:
10182585
Journal Name:
Scientific Reports
Volume:
10
Issue:
1
ISSN:
2045-2322
Publisher:
Nature Publishing Group
Sponsoring Org:
National Science Foundation
More Like this
  1. Baraldi, P. ; Zio, E. (Ed.)
    Critical infrastructure networks are becoming increasingly interdependent which adversely impacts their performance through the cascading effect of initial failures. Failing to account for these complex interactions could lead to an underestimation of the vulnerability of interdependent critical infrastructure (ICI). The goal of this research is to assess how important interdependent links are by evaluating the interdependency strength using a dynamic network flow redistribution model which accounts for the dynamic and uncertain aspects of interdependencies. Specifically, a vulnerability analysis is performed considering two scenarios, one with interdependent links and the other without interdependent links. The initial failure is set to be the same under both scenarios. Cascading failure is modeled through a flow redistribution until the entire system reaches a stable state in which cascading failure no longer occurs. The unmet demand of the networks at the stable state over the initial demand is defined as the vulnerability. The difference between the vulnerability of each network under these two scenarios is used as the metric to quantify interdependency strength. A case study of a real power-water-gas system subject to earthquake risk is conducted to illustrate the proposed method. Uncertainty is incorporated by considering failure probability using Monte Carlo simulation. By varyingmore »the location and magnitude of earthquake disruptions, we show that interdependency strength is determined not only by the topology and flow of ICIs but also the characteristics of the disruptions. This compound system-disruption effect on interdependency strength can inform the design, assessment, and restoration of ICIs.« less
  2. Pattern counting in graphs is a fundamental primitive for many network analysis tasks, and there are several methods for scaling subgraph counting to large graphs. Many real-world networks have a notion of strength of connection between nodes, which is often modeled by a weighted graph, but existing scalable algorithms for pattern mining are designed for unweighted graphs. Here, we develop deterministic and random sampling algorithms that enable the fast discovery of the 3-cliques (triangles) of largest weight, as measured by the generalized mean of the triangle’s edge weights. For example, one of our proposed algorithms can find the top-1000 weighted triangles of a weighted graph with billions of edges in thirty seconds on a commodity server, which is orders of magnitude faster than existing “fast” enumeration schemes. Our methods open the door towards scalable pattern mining in weighted graphs.
  3. Abstract The increased complexity of infrastructure systems has resulted in critical interdependencies between multiple networks—communication systems require electricity, while the normal functioning of the power grid relies on communication systems. These interdependencies have inspired an extensive literature on coupled multilayer networks, assuming a hard interdependence, where a component failure in one network causes failures in the other network, resulting in a cascade of failures across multiple systems. While empirical evidence of such hard failures is limited, the repair and recovery of a network requires resources typically supplied by other networks, resulting in documented interdependencies induced by the recovery process. In this work, we explore recovery coupling, capturing the dependence of the recovery of one system on the instantaneous functional state of another system. If the support networks are not functional, recovery will be slowed. Here we collected data on the recovery time of millions of power grid failures, finding evidence of universal nonlinear behavior in recovery following large perturbations. We develop a theoretical framework to address recovery coupling, predicting quantitative signatures different from the multilayer cascading failures. We then rely on controlled natural experiments to separate the role of recovery coupling from other effects like resource limitations, offering direct evidencemore »of how recovery coupling affects a system’s functionality.« less
  4. Cherry, J M (Ed.)
    Abstract The mechanisms that coordinate cellular gene expression are highly complex and intricately interconnected. Thus, it is necessary to move beyond a fully reductionist approach to understanding genetic information flow and begin focusing on the networked connections between genes that organize cellular function. Continued advancements in computational hardware, coupled with the development of gene correlation network algorithms, provide the capacity to study networked interactions between genes rather than their isolated functions. For example, gene coexpression networks are used to construct gene relationship networks using linear metrics such as Spearman or Pearson correlation. Recently, there have been tools designed to deepen these analyses by differentiating between intrinsic vs extrinsic noise within gene expression values, identifying different modules based on tissue phenotype, and capturing potential nonlinear relationships. In this report, we introduce an algorithm with a novel application of image-based segmentation modalities utilizing blob detection techniques applied for detecting bigenic edges in a gene expression matrix. We applied this algorithm called EdgeCrafting to a bulk RNA-sequencing gene expression matrix comprised of a healthy kidney and cancerous kidney data. We then compared EdgeCrafting against 4 other RNA expression analysis techniques: Weighted Gene Correlation Network Analysis, Knowledge Independent Network Construction, NetExtractor, and Differential genemore »expression analysis.« less
  5. Traffic networks are one of the most critical infrastructures for any community. The increasing integration of smart and connected sensors in traffic networks provides researchers with unique opportunities to study the dynamics of this critical community infrastructure. Our focus in this paper is on the failure dynamics of traffic networks. By failure, we mean in this domain the hindrance of the normal operation of a traffic network due to cyber anomalies or physical incidents that cause cascaded congestion throughout the network. We are specifically interested in analyzing the cascade effects of traffic congestion caused by physical incidents, focusing on developing mechanisms to isolate and identify the source of a congestion. To analyze failure propagation, it is crucial to develop (a) monitors that can identify an anomaly and (b) a model to capture the dynamics of anomaly propagation. In this paper, we use real traffic data from Nashville, TN to demonstrate a novel anomaly detector and a Timed Failure Propagation Graph based diagnostics mechanism. Our novelty lies in the ability to capture the the spatial information and the interconnections of the traffic network as well as the use of recurrent neural network architectures to learn and predict the operation of amore »graph edge as a function of its immediate peers, including both incoming and outgoing branches. Our results show that our LSTM-based traffic-speed predictors attain an average mean squared error of 6.55 10−4 on predicting normalized traffic speed, while Gaussian Process Regression based predictors attain a much higher aver- age mean squared error of 1.78 10−2. We are also able to detect anomalies with high precision and recall, resulting in an AUC (Area Under Curve) of 0.8507 for the precision- recall curve. To study physical traffic incidents, we augment the real data with simulated data generated using SUMO, a traffic simulator. Finally, we analyzed the cascading effect of the congestion propagation by formulating the problem as a Timed Failure Propagation Graph, which led us in identifying the source of a failure/congestion accurately.« less