Percolation in real multiplex networks

Abstract

We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where nodes are present in the system with given probability. The approach relies on the locally treelike ansatz, so that it is expected to accurately reproduce the true percolation diagram of sparse multiplex networks with negligible number of short loops. The performance of our theory is tested in social, biological, and transportation multiplex graphs. When compared against previously introduced methods, we observe improvements in the prediction of the percolation diagrams in all networks analyzed. Results from our method confirm previous claims about the robustness of real multiplex networks, in the sense that the average connectedness of the system does not exhibit any significant abrupt change as its individual components are randomly destroyed.

5 pages, 1 table, 1 figure + Appendix

References in corpus (10)

• The structure and dynamics of multilayer networks
• Critical phenomena in complex networks
• Multirelational Organization of Large-scale Social Networks in an Online World
• Emergence of network features from multiplexity
• MuxViz: A Tool for Multilayer Analysis and Visualization of Networks
• Percolation on sparse networks
• Percolation in real interdependent networks
• Identifying modular flows on multilayer networks reveals highly overlapping organization in social systems
• Predicting percolation thresholds in networks
• Tight lower bound for percolation threshold on a quasi-regular graph

Cited by in corpus (2)

• Epidemic spreading and bond percolation in multilayer networks
• On the accuracy of message-passing approaches to percolation in complex networks