It is essential to study the robustness and centrality of interdependent networks for building reliable interdependent systems. Here, we consider a nonlinear load-capacity cascading failure model on interdependent networks, where the initial load distribution is not random, as usually assumed, but determined by the influence of each node in the interdependent network. The node influence is measured by an automated entropy-weighted multi-attribute algorithm that takes into account both different centrality measures of nodes and the interdependence of node pairs, then averaging for not only the node itself but also its nearest neighbors and next-nearest neighbors. The resilience of interdependent networks under such a more practical and accurate setting is thoroughly investigated for various network parameters, as well as how nodes from different layers are coupled and the corresponding coupling strength. The results thereby can help better monitoring interdependent systems.
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 »
- Publication Date:
- NSF-PAR ID:
- Journal Name:
- Scientific Reports
- Nature Publishing Group
- Sponsoring Org:
- National Science Foundation
More Like this
An influential node identification method considering multi-attribute decision fusion and dependency
Quantifying the Interdependency Strength Across Critical Infrastructure Systems Using A Dynamic Network Flow Redistribution Model.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 »
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.
The power grid is going through significant changes with the introduction of renewable energy sources and the incorporation of smart grid technologies. These rapid advancements necessitate new models and analyses to keep up with the various emergent phenomena they induce. A major prerequisite of such work is the acquisition of well-constructed and accurate network datasets for the power grid infrastructure. In this paper, we propose a robust, scalable framework to synthesize power distribution networks that resemble their physical counterparts for a given region. We use openly available information about interdependent road and building infrastructures to construct the networks. In contrast to prior work based on network statistics, we incorporate engineering and economic constraints to create the networks. Additionally, we provide a framework to create ensembles of power distribution networks to generate multiple possible instances of the network for a given region. The comprehensive dataset consists of nodes with attributes, such as geocoordinates; type of node (residence, transformer, or substation); and edges with attributes, such as geometry, type of line (feeder lines, primary or secondary), and line parameters. For validation, we provide detailed comparisons of the generated networks with actual distribution networks. The generated datasets represent realistic test systems (as comparedmore »
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 »