Article | Open | Published:

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

## Abstract

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.

## Introduction

Studying complex systems includes analyzing how the different components of a given system interact with each other and how this interaction affects the system’s global collective behavior. In recent years complex network research has been a powerful tool for examining these systems, and the initial research on isolated networks has yielded interesting results1,2,3.

A network is a graph composed of nodes that represent interacting individuals, companies, or elements of an infrastructure. Node interactions are represented by links or edges. Real-world systems rarely work in isolation and often crucially depend on one another4,5,6,7,8,9,10. Thus single-network models have been extended to more general models of interacting coupled networks, the study of which has greatly expanded our understanding of real-world complex systems. One intensive study of these “networks of networks” has focused on the propagation of failure among closely-related systems11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26. The great blackout of Italy in 2003 and the earthquake of Japan in 2011 were catastrophic events that demonstrated that breakdowns in power grids strongly impact other systems such as communication and transport networks, and that the failure of these networks in turn accelerates the failure of the power grid. The propagation of these “failure cascades” has received wide study in recent years11,12,13,14,15,16,17,18,19,20,21,27,28.

The simplest model of these systems consists of two interdependent networks in which nodes in one network are connected by a single bidirectional edge to nodes in a second network11. In this model a node is functional (i) if it belongs to the largest connected component (the “giant component”) in its own network (the internal rule of functionality) and (ii) if its counterpart in the other network is also functional (the external rule of functionality). This original model has been extended to include localized and targeted attacks15,29,30,31,32 and mitigation13,25,26,33,34 and recovery strategies27,35. Recently it was found that the giant component membership requirement can be replaced by a weaker requirement of belonging to a cluster of a size larger than or equal to a threshold h * 28. Alternatively, a heterogeneous k-core condition can be applied as an internal functionality condition in which node i is functional when at least $${k}_{i}^{\ast }$$ nodes among its k i immediate neighbors remain functional36,37,38,39,40. In this model the random failure of a critical fraction of nodes in an isolated network leads to an abrupt collapse of this network.

Although the original interdependent network model expanded our understanding of different coupled systems, the single-dependency relationship between nodes in different networks does not accurately represent what happens in real-world structures. A cascading failure model of a network of networks with multiple dependency edges has been applied to a scenario in which nodes fail only when they lose all their support nodes in the other network14,17, but nodes in complex real-world systems can be so fragile that the loss of a single support link can cause them to shut down. More generally, each node may require a certain minimal number of supply links connected to the nodes in the other network to remain functional. In the world-wide economic system, for example, banks and financial firms lend money to non-financial companies who must pay the amount back with interest after a stated period of time. If a single non-financial company becomes insolvent, the bank that lent money to this company will likely not fail, but if the number of companies that cannot pay back their loans is sufficiently large, the possibility of bank failure becomes real. This resembles the k-core process in a single network described above.

Here we model the process of cascading failure in a system of two interdependent networks A and B in which nodes have multiple connections or supply-demand links between networks. In the following, network X means either network A or B. Each node i in network X has k sX,i supply nodes in the other network that are connected to node i by supply links. This node remains functional at a certain stage of the cascade of failures if the number of its functional supply nodes in the other network remains greater or equal to its supply threshold k sX,i * ≤ k sX,i . We call this the external functionality condition. We assume that a supply threshold is predefined for each node.

In principle, this model is non-trivial even if the survival of a node in network X does not directly depend on the internal connectivity of network X. In this case our model is equivalent to cascading failures in a bipartite network composed of two sets of nodes A and B connected only by supply-demand links, i.e., these networks only have external functionality. For generality, we add to the external functionality condition an internal functionality condition that can be one of the following: a node is functional (i) when it belongs to the giant component of its network (“giant component rule”), (ii) when it belongs to a finite component of size h that survives with probability 1 − q(h) (“mass rule”), and (iii) when a node i with internal connectivity k i has a number of functional neighbors greater than or equal to k i * (“k-core rule”).

We develop a theoretical model that is solved using the formalism of generating functions. We present numerical solutions and compare them with stochastic simulations. We find that for all internal rules of functionality, increasing the $${k}_{sX}^{\ast }$$ value increases system vulnerability and often causes a discontinuous transition. For the mass rule of internal functionality we find a continuous transition for some parameter values. We also study the asymptotic limit of a large number of supply links, and we find a relation between the critical threshold of initial failure and the ratio $${k}_{sX}^{\ast }$$/k sX .

## Model

We assume that the system consists of two networks A and B with internal degree distributions P A (k) and P B (k), respectively, where k is the degree of a node within its own network. Each node i in network A is supplied by k sA,i supply links from nodes in network B, and each node j in network B has k sB,j demand links that act as supply links for nodes in network A. For simplicity we assume that the demand links in network A serve as supply links for nodes in network B, and that supply links in network A serve as demand links for nodes in network B. Thus each supply-demand link is a bidirectional link that connects a node in network A with a node in network B. If the internal degree of all nodes in networks A and B is zero, our model is equivalent to a bipartite network. We assume that the degree distribution of supply-demand links in network A is P sA (k) and the degree distribution of supply-demand links in network B is P sB (k). In principle, some nodes may not have supply links and still remain functional13. If this is the case, P sA (0) > 0.

The functionality of the nodes in both networks is related to their connections within their own network, which we call the internal rule of functionality. In addition, the state of the nodes also depends on the supply demand links that connect both networks, which we call the external rule of functionality.

We study three different internal rules of functionality:

1. (I)

Model I (The “giant component” rule): nodes that belong to the giant component in their own network are functional.

2. (II)

Model II (The “finite component” or “mass” rule): a finite component of size h remains functional with a probability 1 − q(h). If it fails, all of its nodes fail. If it survives, all of its nodes remain functional.

3. (III)

Model III (The “k-core” rule): a node i with internal connectivity k i remains active if the number of its functional neighbors is greater than or equal to $${k}_{i}^{\ast }$$.

The external rule of functionality states that nodes in network X must be connected with the other network through a number of functional supply links greater than or equal to $${k}_{sX}^{\ast }$$.

We call $${k}_{sX,i}^{\ast }$$ the supply-demand functionality threshold of node i, since in principle the threshold may be different for different nodes. For conceptual simplicity, we assume that the supply thresholds are predefined for each node by random selection from a cumulative probability distribution r sX (j, k) = P($${k}_{sX}^{\ast }$$ ≤ j|k sX  = k), where P(|) is the conditional probability. Alternatively, function r sX (j, k) can be understood as a probability that a node with k supply links remains functional if j of its k supply nodes in the other network remains functional.

For example, in the case of a uniform supply threshold $${k}_{sX}^{\ast }$$ = m where m is a constant, the distribution r sX is a step function, i.e., r sX (j, k) = 0 for j < m and r sX (j, k) = 1 for j ≥ m. Another option is linear: r sX (j, k) = j/k. For autonomous nodes that can survive without any functional supply nodes in the other network, $${k}_{sX}^{\ast }$$ = 0. This case is included in the general scheme if we assume that r sX (0, k sX ) > 0.

Figure 1a shows a schematic of the internal rules of functionality, and Fig. 1b,c show a schematic of the external rules of functionality. In each network green nodes are functional, i.e., they satisfy both internal and external conditions of functionality. Red nodes are affected by the initial failure, blue nodes do not satisfy internal conditions of functionality and pink nodes do not satisfy external conditions of functionality. Internal links are black, and supply links are orange. Here we use P sA (k) = P sB (k) = δ k,3, but for simplicity in Fig. 1b,c we omit the internal links and some of the supply-demand links in network A. For example, in Fig. 1b node A3 has two additional supply nodes from network B that are not shown. Figure 1b shows the case k s,i * = 1 for all i. Note that since all nodes in network B receive supplies from functional node A0 they are unaffected when other nodes in network A fail. On the other hand, Fig. 1c shows that when k s,i * = 2 all nodes must have two functional supply nodes from the other network to remain functional. Nodes B2 and B3 are connected to A0, receive supplies from functioning nodes A3 and A6, respectively, and remain active. On the other hand, because node B1 is only supported by node A0, it fails, as indicated by the pink color.

## Theoretical approach

We construct a system of two randomly connected networks in which connectivity links within each network follow degree distributions P A (k) and P B (k) and supply-demand links between the networks follow distributions P sA (k) and P sB (k). For this system we achieve a theoretical solution within the limit of a large number of nodes, N A and N B , where N A and N B are the number of nodes in networks A and B, respectively. The bidirectionality of the supply-demand links requires that relation N A k sA  = N B k sB is satisfied, where 〈k sA and 〈k sB are the average degrees of the supply links in networks A and B respectively.

When we randomly remove a fraction 1 − y X of nodes from network X, the remaining fraction of active nodes μ X for an isolated network X is determined by which internal functionality rule is followed. It can be expressed in the closed-form expression μ X  = y X g X (y X ), where g X (y X ) ≤ 1 is an exacerbation factor that takes into account additional node failures triggered by the random removal of a fraction of 1 − y X nodes. The explicit form of this factor is determined by the internal functionality rules of the model. The Supplementary Information presents equations for g X for Rules I, II, and III (see Supplementary Information: section Explicit form of the functionality rules). For example, for a bipartite network g X (y X ) = 1.

The cascading process begins with a random failure in network A. This failure causes an additional loss of nodes determined by the exacerbation factor. This event triggers a cascade in which failure is transmitted back and forth between networks A and B through the supply-demand links, and this further decreases the fraction of functional nodes. The external functionality rule states that node i with k s,i supply-demand links must have $${k}_{s,i}^{\ast }$$ or more nodes to remain functional, similar to k-core percolation.

External functionality failure is similar to heterogeneous k-core percolation37. To describe this failure due to a lack of supply between networks A and B, we introduce the functions W sA (x),W sB (x) and Z sA (x),Z sB (x), which are the k-core generating functions of the degree distribution and the excess degree distribution of the supply-demand links in networks A and B, respectively. These functions depend on the degree distributions P sA and P sB of supply-demand links and the distribution of the thresholds r sA (j,k) and r sB (j,k) of the supply-demand links in networks A and B,

$${W}_{sX}(\beta )=\sum _{k=0}^{\infty }{P}_{sX}(k)\sum _{j=0}^{k}(\begin{array}{c}k\\ j\end{array}){r}_{sX}(j,k){\beta }^{j}{\mathrm{(1}-\beta )}^{k-j}$$
(1)

and

$${Z}_{sX}(\beta )=\sum _{k=0}^{\infty }\frac{k{P}_{sX}(k)}{{\langle {k}_{s}\rangle }_{X}}\sum _{j=0}^{k-1}(\begin{array}{c}k-1\\ j\end{array}){r}_{sX}(j+\mathrm{1,}\,k){\beta }^{j}{\mathrm{(1}-\beta )}^{k-j-1},$$
(2)

where 〈k s X is the average number of supply links per node in network X. In this context β is the probability that a functional node will be selected. Similar formulas were derived in ref.41 for a variant of the Watts opinion model42.

We next examine a theoretical approach to the temporal evolution of the cascading process. As explained above, initially a randomly selected fraction 1 − p of nodes fails in network A. Then the surviving fraction of nodes in network A in this first stage of the cascade is μ A,1 = pg A (p). We introduce a new parameter f B , which is the probability of randomly choosing a supply link that is connected to a functional node in the other network. When a node fails, all its demand links also fail. Thus f B,1 = μ A,1.

After applying the external functionality rule to network B, the fraction of nodes that fulfill the conditions is given by y B,1 = W sB (f B,1). Because there are additional disconnected nodes in network B given by the exacerbation factor g B , the number of functional nodes in network B at the first stage of the cascade is μ B,1 = y B,1 g B (y B,1). In the second stage of the cascade we cannot apply the same rules to obtain μ A,2, because f A,2μ B,1. If, for example, a supply-demand link connects nodes i in A and j in B, then the probability that this link is active depends on how many other links belonging to nodes i or j are active. Thus the fraction of surviving links at this step is f A,2 = Z sB (f B,1)g B (y B,1).

Thus the recursion relations for the stages n > 1 are

$$\begin{array}{rcl}{f}_{A,n} & = & {Z}_{sB}({f}_{B,n-1})\,{g}_{B}({y}_{B,n-1});\\ {f}_{B,n} & = & p\,{Z}_{sA}({f}_{A,n})\,{g}_{A}({y}_{A,n}),\end{array}$$
(3)

where

$$\begin{array}{rcl}{y}_{A,n} & = & p\,{W}_{sA}({f}_{A,n});\\ {y}_{B,n} & = & {W}_{sB}({f}_{B,n})\end{array}$$
(4)

are the fractions of nodes that satisfy the external rule of functionality, i.e., randomly removing a fraction of 1 − y X,n nodes leaves the same number of functional nodes as in stage n of the cascade. The fractions of functional nodes at stage n of the cascade are

$$\begin{array}{rcl}{\mu }_{A,n} & = & {y}_{A,n}\,{g}_{A}({y}_{A,n});\\ {\mu }_{B,n} & = & {y}_{B,n}\,{g}_{B}({y}_{B,n}\mathrm{).}\end{array}$$
(5)

The process begins with f A,1 = 1 and y A,1 = p, which is equivalent to an initial random failure on network A.

## Results

We next present these theoretical results using several simple examples and verifying them with stochastic simulations.

To test the validity of the equations, Fig. 2 shows the temporal evolution of the order parameter of networks A and B close to the critical threshold p c , computed using the equations and stochastic simulations when the giant component functionality rule is applied (see Supplementary Information: subsections Giant Component and Numerical Solution for the threshold p c ). Note that the plots show the simulation results are in total agreement with the theoretical results.

Figure 3 shows a plot of μ A and μ B in the steady state as a function of the initial fraction of surviving nodes p when the giant component rule is applied. The results for the k-core rule are shown in the Supplementary Information. We use two random regular (RR) networks with a degree distribution P X (k) = δ k,5, with X = A, B, and where the distribution of supplies is also RR with P s,A (k) = P s,B (k) = δ k,5. For the external rule of functionality we use r sX (j, k) = 0 if j < m and r sX (j, k) = 1 if j ≥ m for all m from m = 1 to m = 4. The results obtained from the equations (dashed lines) agree with the results of the simulations (symbols). In addition we compare the results of the present model with the results of the original model of cascading failures11 shown as a dashed-dotted line in which P X (k) = δ k,5, but P s,A (k) = P s,B (k) = δ k,1 and m = 1.

Note that in network A the order parameter for all values of k s * is proportional to p until it begins to drop and become close to the critical threshold p c . This means that the depletion of the supply from network B does not significantly impact network A until it reaches the collapse threshold at which the system breaks down with a discontinuous transition. We calculate this critical value numerically using the generating functions (see Supplementary Information: section Numerical solution for the threshold p c ). Note also that, as expected, the behavior of network B is different. Because there is no initial random failure in network B, it remains more intact than network A. When network A crumbles, however, both networks collapse. Thus despite its damage being minor the transition in network B is more abrupt, more unexpected, and, therefore, more dangerous. This is the key difference between the present mode and the original model11 in which the behaviors of network A and B are identical. In addition, note that the system is more resilient when k s * is smaller, i.e., when the supply level decreases. We also observe that the interdependent system with only one supply-demand link (the dashed-dotted line) is more resilient than a system with more connections between the two networks, but with large functionality thresholds m ≥ 3.

If instead of the giant component we apply the k-core as an internal functionality rule we get the same qualitative results. For different values of k * and k s * the order parameters also undergo a discontinuous transition, and the system becomes more vulnerable when the threshold of internal links and the threshold of supply links increases (see Supplementary Information: section k-core Percolation).

When applying the “mass” rule, finite components of size h in network X survive with a probability 1 − q X (h). When all nodes have a single supply-demand link, i.e., when k s  = 1 and k s * = 1, and all finite components of size greater than or equal to h = 2 are preserved, the system undergoes a continuous transition28. Here q X (1) = 1 and q X (h) = 0 for h ≥ 2. If the number of supply links increases and the threshold k s * = 1 is fixed, the system becomes more resilient and the transition remains continuous. In contrast, if all the components of size h = 2 are removed [q X (2) = 1] the transition becomes discontinuous irrespective of the number of supply-demand links connecting the networks. Nevertheless, not all the components of size h = 2 need to survive to have a continuous transition. Figure 4 shows the order parameters for q(2) = 0.3 and q(2) = 0.85 when q A (h) = q B (h) = q(h). Note that when q(2) = 0.3 the transition is continuous even when some of the components of size h = 2 are deleted. When q(2) = 0.85 the number of surviving h = 2 components is insufficient to prevent an abrupt transition.

Thus when k s * = 1 there is a critical value of q(2) = q c (2) that separates the zone of continuous transition from the zone of discontinuous transition. Figure 5 shows a phase diagram for a system of networks following the “mass” rule with an internal distribution P A (k) = P B (k) = δ k,5 and supply distribution P sA (k) = P sB (k) = δ k,ks . Note that the behavior of the critical probability as a function of the number of supply-links k s between the networks delimits these two zones. As k s increases the system becomes more robust, and more components must fail to cause an abrupt transition. In the limiting case k s  → ∞ the curve reaches the value q c (2) = 1, but also p c  → 0. On the other hand, when k s * > 1 the transition is always discontinuous for any value of q(s) and sufficiently large k s .

What happens if no internal functionality rule is applied? This could be the case in a bipartite system in which nodes within each network do not interact but use nodes in the other network as bridges to establish connections. Here the exacerbation factor is simply g X (y) = 1, which simplifies the equations. If we analyze this system for different functions r sX (j,k) (see Supplementary Information: section Examples of r sX (j,k) functions) we see that if r sX (j,k) is a step function with fixed threshold $${k}_{sX}^{\ast }$$ = 2, the transition is continuous, but it is discontinuous for $${k}_{sX}^{\ast }$$ > 2, and there is no transition for p > 0 if $${k}_{sX}^{\ast }$$ = 1. Also if we choose a linear function, i.e., r sX (j, k sX ) = j/k sX , there is again no transition because here functions W s (β) and Z s (β) become linear functions of β. On the other hand, when the function r sX is by nonlinear, the behavior changes. Figure 6 shows the behavior of the order parameter of network A for a polynomial function r sX (j, k sX ) = 3(j/k sX )2 − 2(j/k sX )3 and for a supply-demand distribution P s,X (k) = δ k,ks . Note that for small values of k s the order parameter moves smoothly to zero but for k s  = 8 the system undergoes a discontinuous transition. The existence of these transitions can be explained studying Eqs (3) and (4) (see Supplementary Information: section Numerical solution for the threshold p c ).

Unlike the previous results, the transition here does not produce a total collapse of the system, and after the jump a small fraction of nodes remains functional for any p > 0. If a delta-distribution of supply links is replaced by the Poisson distribution with 〈k s X  = λ, we find a critical point on a (p, λ) plane λ c  = 7.58465, p c  = 0.728102 at which the first order phase transition emerges. For λ > λ c the transition is first order and for λ < λ c there is no phase transition for p > 0. At this point the system belongs to the mean-field universality class, such as the Ising model in infinite dimensions where p corresponds to the ordering field and λ to the thermal field.

We next analyze the limiting case of large k s values when all nodes in network B have a fixed threshold k sB *, and we find that the collapse threshold p c converges to a value determined by the ratio γ ≡ k sB */k sB given by

$$\gamma ={p}_{c}{g}_{A}({p}_{c}),$$
(6)

which is valid for all of the internal failure rules.

The p c value depends on γ in this limit because when 〈k sX 〉 → ∞ the functions W sB (β) and Z sB (β) become step functions equal to 0 for β < γ and to 1, otherwise. Note that γ only relates to the external properties of network B, but that the value of p c depends solely on the topology of network A. This is because network B is intact above p c , but when p < p c all the supply-demand links maintaining the integrity of network B fail and the entire structure crumbles. Thus here the topology of network B does not affect the final state of the system. See Supplementary Information: section Asymptotic properties of the functions W s and Z s for the derivation of Eq. (6).

Figure 7 shows the behavior of Eq. (6) for each internal rule of functionality and for several values of internal connectivity z A in network A when it has an internal degree distribution P A (k) = δ k,zA . Note that all curves go to p c  = 1 when γ → 1, i.e., $${k}_{sB}^{\ast }\sim {k}_{sB}$$, and thus even a small perturbation can cause a system breakdown. In contrast, curves with higher z A values have lower p c values because increased connectivity means increased resilience. In addition, when γ → 0 then $${k}_{sB}\gg {k}_{sB}^{\ast }$$, rendering the influence of network B on network A insignificant. Here network A behaves as an isolated system. We see this in the giant component rule [see Fig. 7a] in which p c  → 1/(z A  − 1) as γ → 0, a value that corresponds to the critical threshold of node percolation43,44 in isolated RR networks. Similarly, for the “mass” rule we find that p c  → 0 when γ → 0 because when there is an initial attack 1 − p on an isolated network there are always components of varying masses in the thermodynamic limit (with an infinite number of nodes). Thus for any size h there are always surviving components when p > 0.

If there is a Poisson internal degree distribution in network A, i.e., P A (k) = exp[−〈k A ]〈k A k/k! where 〈k A is the mean connectivity, we can write a closed-form expression for p c for the giant component rule,

$${p}_{c}=\frac{\gamma }{1-{\exp }[-\gamma \,{\langle k\rangle }_{A}]}\mathrm{.}$$
(7)

Note that p c does not depend on the internal degree distribution of network B. The derivation of Eq. (7) is supplied in the Supplementary Information: section Asymptotic properties of the functions W s and Z s . On the other hand, if the system is bipartite then from Eq. (6) the critical value is simply p c  = γ.

## Discussion

We have analyzed the cascading failure process in a system of two interdependent networks in which nodes within each network have multiple connections, or supply-demand links, with nodes from their counterpart network. In this model each node must have at least a given number of supply-links leading to functional nodes in the other network to remain active. We call this number the supply threshold and we call this condition the external functionality rule. We have studied the process under three internal functionality rules, (I) nodes must belong to the giant component in their own network, (II) nodes that belong to a finite component survive with a probability determined by the mass of the component, and (III) an internal version of the external functionality rule, known as heterogeneous k-core percolation. In addition, we have studied a system in the absence of any internal functionality rule, which is equivalent to a bipartite network. Our system is a generalization of the models of interdependent networks11,13 that represent a particular case of our model with P sX (k) = 0 for k > 1 and a giant component rule of internal functionality. Our model shows a rich behavior for various parameter values that is characterized by the appearance of discontinuous first order transitions. In some cases, multiple first order transitions can be observed, a situation impossible in the original models11,13.

We have found that for all the internal functionality rules the system is more robust when the supply threshold is lower. Under internal rules I and III there is a discontinuous transition at a collapse threshold p = p c . The main difference between our model and the previously studied models11,13 is that in the case of multiple supply links the initial attack on network A does not immediately affect network B, and it remains more functional than network A for any p > p c . This makes the transition, when it occurs in network B, more abrupt than in network A. These sudden breakdowns can come without warning. In some catastrophic events, e.g., an earthquake of sub-threshold strength, the damage to network B may be minor and the development of precautions or recovery strategies thus deemed of minor importance. This becomes problematic when the strength of an earthquake exceeds a certain threshold and causes a total breakdown in network B. In contrast, in “mass” rule II for k s * = 1 the transition can be continuous depending on the probability that components of size h = 2 remain functional and on the number of supply-demand links. For each value of k s there is a critical probability q(2) below which the transition becomes discontinuous.

When the model is applied to a bipartite system, the behavior is determined by function r sX . In particular, when this function is polynomial there is no transition in k sX  ≤ 7, but when k s increases this curve breaks and becomes discontinuous.

Finally we have studied the asymptotic limit value of the number of supply-demand links, and find that when r sB is a step function there is an exact relationship between the ratio γ = k sB */k sB and the collapse threshold p c . We also find that in this limit the resilience of the interacting system is enhanced up to the point at which the critical threshold p c is solely dependent on the topology of network A.

## Methods

For the stochastic simulations we use for both networks a system size of N = 106 to compute the steady state and N = 108 for the temporal evolution close to the critical threshold (See Fig. 2). We use the Molloy-Reed Algorithm45 for the construction of the networks. The simulation results are averaged over 1000 network realizations.

For model II, the “mass” rule, a finite component of size h survives with probability 1 − q(h). In the stochastic simulations if a finite component remains after the internal failure at a step of the cascade, then in the following steps of the cascade this component only can fail due to the external rule of functionality.

In our theoretical analysis, to calculate the values of the order parameters at the steady state we iterate the temporal evolution Eqs (3)–(5) until the condition μ A  ≡ μ A,n  = μ A,n − 1 is satisfied. At this stage the magnitudes of all order parameters reach a steady state and no longer change.

Publisher's note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## References

1. 1.

Newman, M. E. J. Networks, An Introduction (Oxford University Press, 2010).

2. 2.

Estrada, E. The Structure of Complex Networks: Theory and Applications (Oxford University Press, 2011).

3. 3.

Barrat, A., Barthelémy, M. & Vespigniani, A. Dynamical Processes on Complex Networks (Cambrige University Press, 2013).

4. 4.

Rosato, V. et al. Modelling interdependent infrastructures using interacting dynamical models. IJCIS 4, 63–79 (2008).

5. 5.

US Canada Power System Outage Task - Force. Final Report on the August 14, 2003 Blackout in the United States and Canada: Causes and Recommendations. The Task Force (2004).

6. 6.

Peerenboom, J., Fischer, R. & Whitfield, R. Workshop mitigating the vulnerability of critical infrastructures to catastrophic failures. Proc. CRIS/DRM/IIIT/NSF (2001).

7. 7.

Rinaldi, S. M., Peerenboom, J. P. & Kelly, T. K. Identifying, understanding, and analyzing critical infrastructure interdependencies. Control Systems, IEEE 21, 11–25 (2001).

8. 8.

Yagan, O., Qian, D., Zhang, J. & Cochran, D. Optimal allocation of interconnecting links in cyber-physical systems: Interdependence, cascading failures and robustness. IEEE Transactions on Parallel and Distributed Systems 23, 1708 (2012).

9. 9.

Kenett, D. Y., Perc, M. & Boccaletti, S. Networks of networks - an introduction. Chaos, Solitons and Fractals 80 (2015).

10. 10.

Wang, Z., Wang, L., Szolnoki, A. & Perc, M. Evolutionary games on multilayer networks: a colloquium. The European Physical Journal B 88 (2015).

11. 11.

Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E. & Havlin, S. Catastrophic cascade of failures in interdependent networks. Nature 464, 1025–1028 (2010).

12. 12.

Buldyrev, S. V., Shere, N. W. & Cwilich, G. A. Interdependent networks with identical degrees of mutually dependent nodes. Phys. Rev. E 83, 016112 (2011).

13. 13.

Parshani, R., Buldyrev, S. V. & Havlin, S. Interdependent networks: reducing the coupling strength leads to a change from a first to second order percolation transition. Phys. Rev. Lett. 105, 048701 (2010).

14. 14.

Shao, J., Buldyrev, S. V., Havlin, S. & Stanley, H. E. Cascade of failures in coupled network systems with multiple support-dependence relations. Phys. Rev. E 83, 036116 (2011).

15. 15.

Huang, X., Gao, J., Buldyrev, S. V., Havlin, S. & Stanley, H. E. Robustness of interdependent networks under targeted attack. Phys. Rev. E 83, 065101 (2011).

16. 16.

Gao, J., Buldyrev, S. V., Havlin, S. & Stanley, H. E. Robustness of a network of networks. Phys. Rev. Lett. 107, 195701 (2011).

17. 17.

Gao, J., Buldyrev, S. V., Stanley, H. E. & Havlin, S. Networks formed from interdependent networks. Nat. Phys. 8, 40 (2012).

18. 18.

Li, W., Bashan, A., Buldyrev, S. V., Stanley, H. E. & Havlin, S. Cascading failures in interdependent lattice networks: The critical role of the length of dependency links. Phys. Rev. Lett. 108, 228702 (2012).

19. 19.

Gao, J., Buldyrev, S. V., Havlin, S. & Stanley, H. E. Robustness of a network of networks. Phys. Rev. E 85, 066134 (2012).

20. 20.

Bashan, A., Berezin, Y., Buldyrev, S. V. & Havlin, S. The extreme vulnerability of interdependent spatially embedded networks. Nat. Phys. 9, 667 (2013).

21. 21.

Gao, J., Buldyrev, S. V., Stanley, H. E., Xu, X. & Havlin, S. Percolation of a general network of networks. Phys. Rev. E 88, 062816 (2013).

22. 22.

Son, S.-W., Bizhani, G., Christensen, C., Grassberger, P. & Paczuski, M. Percolation theory on interdependent networks based on epidemic spreading. EPL 97, 16006 (2012).

23. 23.

Bianconi, G. & Dorogovtsev, S. N. Multiple percolation transitions in a configuration model of a network of networks. Phys. Rev. E 89, 062814 (2014).

24. 24.

Baxter, G. J., Dorogovtsev, S. N., Goltsev, A. V. & Mendes, J. F. F. Avalanche collapse of interdependent networks. Phys. Rev. Lett. 109, 248701 (2012).

25. 25.

Valdez, L. D., Macri, P. A., Stanley, H. E. & Braunstein, L. A. Triple point in correlated interdependent networks. Phys. Rev. E 88, 050803(R) (2013).

26. 26.

Valdez, L. D., Macri, P. A. & Braunstein, L. A. Triple point induced by targeted autonomization on interdependent scale free networks. J. Phys. A: Math. Theor 47, 055002 (2014).

27. 27.

Di Muro, M. A., La Rocca, C. E., Stanley, H. E., Havlin, S. & Braunstein, L. A. Recovery strategy on interdependent networks. Sci. Rep. 6, 22834 (2016).

28. 28.

Di Muro, M. A., Buldyrev, S. V., Stanley, H. E. & Braunstein, L. A. Cascading failures in interdependent networks with finite functional components. Phys. Rev. E 94, 042304 (2016).

29. 29.

Yuan, X., Dai, L., Stanley, H. E. & Havlin, S. k-core percolation on complex networks: Comparing random, localized, and targeted attacks. Phys. Rev. E 93, 062302 (2016).

30. 30.

Dong, G. et al. Robustness of network of networks under targeted attack. Phys. Rev. E 87, 052804 (2013).

31. 31.

Tanizawa, T., Havlin, S. & Stanley, H. E. Robustness of onionlike correlated networks against targeted attacks. Phys. Rev. E 85, 046109 (2012).

32. 32.

Zhao, J., Li, D., Sanhendrai, H., Cohen, R. & Havlin, S. Spatio-temporal propagation of cascading overload failures in spatially embedded networks. Nature Commun. 7 (2016).

33. 33.

Schneider, C. M., Yazdani, N., Araújo, N. A., Havlin, S. & Herrmann, H. J. Towards designing robust coupled networks. Sci. Rep. 3, 1969 (2013).

34. 34.

Parshani, R., Rozenblat, C., Ietri, D., Ducruet, C. & Havlin, S. Inter-similarity between coupled networks. EPL 92, 68002 (2010).

35. 35.

Hu, F., Yeung, C. H., Yang, S. & Zen, A. Recovery of infrastructure networks after localised attacks. Sci. Rep. 6, 24522 (2016).

36. 36.

Baxter, G., Dorogovtsev, S., Goltsev, A. & Mendes, J. Heterogeneous k-core versus bootstrap percolation on complex networks. Phys. Rev. E 83, 051134 (2011).

37. 37.

Cellai, D., Lawlor, A., Dawson, K. A. D. & Gleeson, J. P. Critical phenomena in heterogeneous k-core percolation. Phys. Rev. E 87, 022134 (2013).

38. 38.

Dorogovtsev, S. & Mendes, J. Evolution of networks. Adv. Phys. 51, 1079 (2002).

39. 39.

Dorogovtsev, S., Goltsev, A. & Mendes, J. Critical phenomena in complex networks. Rev. Mod. Phys. 80, 1275 (2008).

40. 40.

Baxter, G., Dorogovtsev, S., Goltsev, A. & Mendes, J. Bootstrap percolation on complex networks. Phys. Rev. E 82, 011103 (2010).

41. 41.

Gleeson, J. P. & Cahalane, D. J. An analytical approach to cascades on random networks. Proc. SPIE 6601, 66010W (2007).

42. 42.

Watts, D. J. A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. USA 99 (2002).

43. 43.

Callaway, D. S., Newman, M. E. J., Strogatz, S. H. & Watts, D. J. Network robustness and fragility: Percolation on random graphs. Phys. Rev. Lett. 85, 5468 (2000).

44. 44.

Newman, M. E., Strogatz, S. H. & Watts, D. J. Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118 (2001).

45. 45.

Molloy, M. & Reed, B. A Critical Point for Random Graphs with a Given Degree Sequence. Random Structures and Algorithms 6, 161–180 (1995).

## Acknowledgements

The Boston University work was supported by DTRA Grant HDTRA1-14-1-0017, by DOE Contract DE-AC07-05Id14517, and by NSF Grants CMMI 1125290, PHY 1505000, and CHE-1213217. Yeshiva work was also supported by HDTRA1-14-1-0017. SVB acknowledge the partial support of this research through the Dr. Bernard W. Gamson Computational Science Center at Yeshiva College. MAD and LAB wish to thank to UNMdP, FONCyT and CONICET (Pict 0429/2013, Pict 1407/2014 and PIP 00443/2014) for financial support. HHAR wish to thanks to FAPEMA (UNIVERSAL 1429/16) for financial support.

## Author information

### Affiliations

1. #### Instituto de Investigaciones Físicas de Mar del Plata (IFIMAR)-Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad Nacional de Mar del Plata-CONICET, Funes, 3350, (7600) Mar del Plata, Argentina

• M. A. Di Muro
•  & L. A. Braunstein
2. #### Instituto de Física Enrique Gaviola, CONICET, Ciudad Universitaria, 5000, Córdoba, Argentina

• L. D. Valdez
3. #### Facultad de Matemática, Astronomía, Física y Computación, Universidad Nacional de Córdoba, 5000, Córdoba, Argentina

• L. D. Valdez
4. #### Departamento de Física, Instituto Federal de Educação, Ciência e Tecnologia do Maranhão, São Luís, MA, 65030-005, Brazil

• H. H. Aragão Rêgo
5. #### Department of Physics, Yeshiva University, 500 West 185th Street, New York, 10033, USA

• S. V. Buldyrev
6. #### Center for Polymer Studies, Boston University, Boston, Massachusetts, 02215, USA

• H. E. Stanley
•  & L. A. Braunstein

### Contributions

All authors designed the research, analyzed data, discussed results, and contributed to writing the manuscript. M.A.D., L.D.V., S.V.B. and L.A.B. implemented and performed numerical experiments and simulations.

### Competing Interests

The authors declare that they have no competing interests.

### Corresponding author

Correspondence to M. A. Di Muro.

## Electronic supplementary material

### DOI

https://doi.org/10.1038/s41598-017-14384-y