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
Robustness of Interdependent Random Geometric Networks
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
- NSF-PAR ID:
- 10065775
- Date Published:
- Journal Name:
- IEEE Transactions on Network Science and Engineering
- ISSN:
- 2327-4697
- Page Range / eLocation ID:
- 1 to 1
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
more » « less
Abstract The inferred narrow range of crack densities of crustal rocks at depths >1 km has been interpreted to imply that crack networks at depth are in a state of criticality with densities restricted to values near the percolation threshold. Their state is critical in the sense that at crack densities above this threshold, both the permeability and compliance increase significantly, allowing pore fluids to disperse and stresses to relax, limiting further crack growth. This analysis assumes that the crack density percolation threshold is similar to that of crack networks composed of randomly located cracks, yet network structure due to crack growth processes is known to impact the percolation threshold. Using ice as a model material for rock, we show experimentally that near the brittle‐to‐ductile transition, the crack density at the percolation threshold depends on the strain rate. At higher strain rates, the strain at percolation is scale invariant, and the crack density percolation threshold is similar to that of random crack networks. At lower strain rates, the strain at percolation increases with sample size, and percolation occurs at crack densities significantly below that at which percolation occurs in random crack networks. Near the brittle‐to‐ductile transition in the deeper crust, crack growth and coalescence may depend on strain rate, changing the nature of crack network criticality.
-
more » « less
Abstract Understanding mechanistic causes of non‐Fickian transport in fractured media is important for many hydrogeologic processes and subsurface applications. This study elucidates the effects of dead‐end fractures on non‐Fickian transport in three‐dimensional (3D) fracture networks. Although dead‐end fractures have been identified as low‐velocity regions that could delay solute transport, the direct relation between dead‐end fractures and non‐Fickian transport has been elusive. We systematically generate a large number of 3D discrete fracture networks with different fracture length distributions and fracture densities. We then identify dead‐end fractures using a novel graph‐based method. The effect of dead‐end fractures on solute residence time maximizes at the critical fracture density of the percolation threshold, leading to strong late‐time tailing. As fracture density increases beyond the percolation threshold, the network connectivity increases, and dead‐end fractures diminish. Consequently, the increase in network connectivity leads to a reduction in the degree of late‐time tailing. We also show that dead‐end fractures can inform about main transport paths, such as the mean tortuosity of particle trajectories. This study advances our mechanistic understanding of solute transport in 3D fracture networks.
-
To better understand the temporal characteristics and the lifetime of fluctuations in stochastic processes in networks, we investigated diffusive persistence in various graphs. Global diffusive persistence is defined as the fraction of nodes for which the diffusive field at a site (or node) has not changed sign up to time t (or, in general, that the node remained active or inactive in discrete models). Here we investigate disordered and random networks and show that the behavior of the persistence depends on the topology of the network. In two-dimensional (2D) disordered networks, we find that above the percolation threshold diffusive persistence scales similarly as in the original 2D regular lattice, according to a power law P(t , L) ∼ t−θ with an exponent θ ~ 0.186, in the limit of large linear system size L. At the percolation threshold, however, the scaling exponent changes to θ ~ 0.141, as the result of the interplay of diffusive persistence and the underlying structural transition in the disordered lattice at the percolation threshold. Moreover, studying finite-size effects for 2D lattices at and above the percolation threshold, we find that at the percolation threshold, the long-time asymptotic value obeys a power law P(t , L) ∼ L−zθ with z ~ 2.86 instead of the value of z = 2 normally associated with finite-size effects on 2D regular lattices. In contrast, we observe that in random networks without a local regular structure, such as Erdos-Rényi networks, no simple power-law scaling behavior exists above the percolation thresholdmore » « less
-
more » « less
Abstract Forest removal for livestock grazing is a striking example of human‐caused state change leading to a stable, undesirable invasive grass system that is resistant to restoration efforts. Understanding which factors lead to resilience to the alternative grass state can greatly benefit managers when planning forest restoration. We address how thresholds of grass cover and seed rain might influence forest recovery in a restoration project on Hawaiʻi Island, USA. Since the 1980s, over 400,000
Acacia koa (koa) trees have been planted across degraded pasture, and invasive grasses still dominate the understory with no native woody‐plant recruitment. Between this koa/grass matrix are remnant nativeMetrosideros polymorpha (ʻōhiʻa) trees beneath which native woody plants naturally recruit. We tested whether there were threshold levels of native woody understory that accelerate recruitment under both tree species by monitoring seed rain at 40 trees (20 koa and ʻōhiʻa) with a range of native woody understory basal area (BA). We found a positive relationship between total seed rain (but not bird‐dispersed seed rain) and native woody BA and a negative relationship between native woody BA and grass cover, with no indication of threshold dynamics. We also experimentally combined grass removal levels with seed rain density (six levels) of two common understory species in plots under koa (n = 9) and remnant ʻōhiʻa (n = 9). Few seedlings emerged when no grass was removed despite adding seeds at densities two to 75 times higher than naturally occurring. However, seedling recruitment increased two to three times once at least 50% of grass was removed. Existing survey data of naturally occurring seedlings also supported a threshold of grass cover below which seedlings were able to establish. Thus, removal of all grasses is not necessary to achieve system responses: Even moderate reductions (~50%) can increase rates of native woody recruitment. The nonlinear thresholds found here highlight how incremental changes to an inhibitory factor lead to limited restoration success until a threshold is crossed. The resources needed to fully eradicate an invasive species may be unwarranted for state change, making understanding where thresholds lie of the utmost importance to prioritize resources.
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1109/TNSE.2018.2846720
