Abstract
Network research has been focused on studying the properties of a single isolated network, which rarely exists. We develop a general analytical framework for studying percolation of interdependent networks. We illustrate our analytical solutions for three examples: (i) For any tree of fully dependent Erdős-Rényi (ER) networks, each of average degree , we find that the giant component is where is the initial fraction of removed nodes. This general result coincides for with the known second-order phase transition for a single network. For any cascading failures occur and the percolation becomes an abrupt first-order transition. (ii) For a starlike network of partially interdependent ER networks, depends also on the topology—in contrast to case (i). (iii) For a looplike network formed by partially dependent ER networks, is independent of .
- Received 24 February 2011
DOI:https://doi.org/10.1103/PhysRevLett.107.195701
© 2011 American Physical Society