Large deviation theory of percolation on multiplex networks

Abstract

Recently increasing attention has been addressed to the fluctuations observed in percolation defined in single and multiplex networks. These fluctuations are extremely important to characterize the robustness of real finite networks but cannot be captured by the traditionally adopted mean-field theory of percolation. Here we propose a theoretical framework and a message passing algorithm that is able to fully capture the large deviation of percolation in interdependent multiplex networks with a locally tree-like structure. This framework is here applied to study the robustness of single instance multiplex networks and compared to the results obtained using extensive simulations of the initial damage. For simplicity the method is here developed for interdependent multiplex networks without link overlap, however it can be generalized to treat multiplex networks with link overlap.

(20 pages, 3 figures)

References in corpus (9)

• The structure and dynamics of multilayer networks
• Critical phenomena in complex networks
• The large deviation approach to statistical mechanics
• Percolation in real interdependent networks
• Recent advances and open challenges in percolation
• Stability of a Giant Connected Component in a Complex Network
• Percolation in real multiplex networks
• Finite connected components in infinite directed and multiplex networks with arbitrary degree distributions
• Percolation transition and distribution of connected components in generalized random network ensembles

Cited by in corpus (3)

• Percolation on complex networks: Theory and application
• Generalized optimal paths and weight distributions revealed through the large deviations of random walks on networks
• Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks