We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Percolation in real interdependent networks.
- Authors
Radicchi, Filippo
- Abstract
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Whereas theoretical methods of direct applicability to real isolated networks exist, the frameworks developed so far in percolation theory for interdependent network layers are of little help in practical contexts, as they are suited only for special models in the limit of infinite size. Here, we introduce a set of heuristic equations that takes as inputs the adjacency matrices of the layers to draw the entire phase diagram for the interconnected network. We demonstrate that percolation transitions in interdependent networks can be understood by decomposing these systems into uncoupled graphs: the intersection among the layers, and the remainders of the layers. When the intersection dominates the remainders, an interconnected network undergoes a smooth percolation transition. Conversely, if the intersection is dominated by the contribution of the remainders, the transition becomes abrupt even in small networks. We provide examples of real systems that have developed interdependent networks sharing cores of 'high quality' edges to prevent catastrophic failures.
- Subjects
PERCOLATION; HEURISTIC algorithms; GRAPHIC methods; SOLUTION (Chemistry); MATRICES (Mathematics)
- Publication
Nature Physics, 2015, Vol 11, Issue 7, p597
- ISSN
1745-2473
- Publication type
Article
- DOI
10.1038/nphys3374