An official website of the United States government
We propose an interdependent random geometric graph (RGG) model for interdependent networks. Based on this model, we study the robustness of two interdependent spatially embedded networks where interdependence exists between geographically nearby nodes in the two networks. We study the emergence of the giant mutual component in two interdependent RGGs as node densities increase, and define the percolation threshold as a pair of node densities above which the giant mutual component first appears. In contrast to the case for a single RGG, where the percolation threshold is a unique scalar for a given connection distance, for two interdependent RGGs, multiple pairs of percolation thresholds may exist, given that a smaller node density in one RGG may increase the minimum node density in the other RGG in order for a giant mutual component to exist. We derive analytical upper bounds on the percolation thresholds of two interdependent RGGs by discretization, and obtain 99% confidence intervals for the percolation thresholds by simulation. Based on these results, we derive conditions for the interdependent RGGs to be robust under random failures and geographical attacks.
more »
« less
Robustness of interdependent geometric networks under inhomogeneous failures
Complex systems such as smart cities and smart power grids rely heavily on their interdependent components. The failure of a component in one network may lead to the failure of the supported component in another network. Components which support a large number of interdependent components may be more vulnerable to attacks and failures. In this paper, we study the robustness of two interdependent networks under node failures. By modeling each network using a random geometric graph (RGG), we study conditions for the percolation of two interdependent RGGs after in-homogeneous node failures. We derive analytical bounds on the interdependent degree thresholds (k 1 ,k 2 ), such that the interdependent RGGs percolate after removing nodes in G i that support more than k j nodes in G j (∀i, j ∈ {1, 2}, i ≠ j). We verify the bounds using numerical simulation, and show that there is a tradeoff between k 1 and k 2 for maintaining percolation after the failures.
more »
« less
- PAR ID:
- 10065778
- Date Published:
- Journal Name:
- 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
- Page Range / eLocation ID:
- 1 to 6
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
An influential node identification method considering multi-attribute decision fusion and dependencyAbstract 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.more » « less
-
Smart grids can be vulnerable to attacks and accidents, and any initial failures in smart grids can grow to a large blackout because of cascading failure. Because of the importance of smart grids in modern society, it is crucial to protect them against cascading failures. Simulation of cascading failures can help identify the most vulnerable transmission lines and guide prioritization in protection planning, hence, it is an effective approach to protect smart grids from cascading failures. However, due to the enormous number of ways that the smart grids may fail initially, it is infeasible to simulate cascading failures at a large scale nor identify the most vulnerable lines efficiently. In this paper, we aim at 1) developing a method to run cascading failure simulations at scale and 2) building simplified, diffusion based cascading failure models to support efficient and theoretically bounded identification of most vulnerable lines. The goals are achieved by first constructing a novel connection between cascading failures and natural languages, and then adapting the powerful transformer model in NLP to learn from cascading failure data. Our trained transformer models have good accuracy in predicting the total number of failed lines in a cascade and identifying the most vulnerable lines. We also constructed independent cascade (IC) diffusion models based on the attention matrices of the transformer models, to support efficient vulnerability analysis with performance bounds.more » « less
-
Abstract Failures within water distribution systems are usually not isolated and tend to propagate to corresponding transportation infrastructure, yet most criticality and resilience analyses of water distribution networks are conducted for the individual water infrastructure without accounting for interdependence. To address this research gap, this study investigates how the critical components identified within water distribution systems may be different when accounting for failure propagation to the transportation road network. In this study, failure propagation is assumed to be based on geospatial interdependence and unidirectional, starting from water distribution network components to transportation network components. A logical interaction network is constructed considering the interdependence between both infrastructures, and multiobjective optimization is used to solve for the critical water distribution components considering: quantity of failures, performance loss, and financial costs. This work presents a modular workflow for water distribution criticality analysis and proposes the Kolmogorov‐Smirnov distance statistic between solution sets as a measure of the significance of interdependency for decision making. Results from the case study suggest that as the magnitude of water infrastructure failure increases beyond a threshold, the interdependency between water distribution and transportation becomes more significant. The difference between identified critical components using only information from water distribution and using both water distribution and transportation is significantly different (with greater than 95% confidence) for the city of Tampa, when more than 40 components fail (are isolated). These results will assist utilities in asset management and strategy assessment, by helping prioritize component repair and better allocate resources for critical interdependent infrastructures.more » « less
-
We consider information-theoretic bounds on the expected generalization error for statistical learning problems in a network setting. In this setting, there are K nodes, each with its own independent dataset, and the models from the K nodes have to be aggregated into a final centralized model. We consider both simple averaging of the models as well as more complicated multi-round algorithms. We give upper bounds on the expected generalization error for a variety of problems, such as those with Bregman divergence or Lipschitz continuous losses, that demonstrate an improved dependence of 1/K on the number of nodes. These “per node” bounds are in terms of the mutual information between the training dataset and the trained weights at each node and are therefore useful in describing the generalization properties inherent to having communication or privacy constraints at each node.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.23919/WIOPT.2018.8362877
