Journal
NATURE COMMUNICATIONS
Volume 8, Issue -, Pages -Publisher
NATURE PORTFOLIO
DOI: 10.1038/s41467-017-01442-2
Keywords
-
Categories
Funding
- US Army Research Office [W911NF-16-1-0104]
- National Science Foundation [CMMI-1552487]
Ask authors/readers for more resources
Optimal percolation is the problem of finding the minimal set of nodes whose removal from a network fragments the system into non-extensive disconnected clusters. The solution to this problem is important for strategies of immunization in disease spreading, and influence maximization in opinion dynamics. Optimal percolation has received considerable attention in the context of isolated networks. However, its generalization to multiplex networks has not yet been considered. Here we show that approximating the solution of the optimal percolation problem on a multiplex network with solutions valid for single-layer networks extracted from the multiplex may have serious consequences in the characterization of the true robustness of the system. We reach this conclusion by extending many of the methods for finding approximate solutions of the optimal percolation problem from single-layer to multiplex networks, and performing a systematic analysis on synthetic and real-world multiplex networks.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available