paper

Robustness of a Network of Networks

arXiv:1010.5829 · doi:10.1103/PhysRevLett.107.195701

Abstract

Almost all network research has been focused on the properties of a single network that does not interact and depends on other networks. In reality, many real-world networks interact with other networks. Here we develop an analytical framework for studying interacting networks and present an exact percolation law for a network of interdependent networks. In particular, we find that for Erdős-Rényi networks each of average degree , the giant component, , is given by where is the initial fraction of removed nodes. Our general result coincides for with the known Erdős-Rényi second-order phase transition for a single network. For any cascading failures occur and the transition becomes a first-order percolation transition. The new law for shows that percolation theory that is extensively studied in physics and mathematics is a limiting case () of a more general general and different percolation law for interdependent networks.

7 pages, 3 figures

References in corpus (1)

Cited by in corpus (146)