Optimal percolation on multiplex networks

Saeed Osat, Ali Faqeeh and Filippo Radicchi ()
Additional contact information
Saeed Osat: Molecular Simulation Laboratory, Department of Physics, Faculty of Basic Sciences, Azarbaijan Shahid Madani University
Ali Faqeeh: Center for Complex Networks and Systems Research, School of Informatics and Computing, Indiana University
Filippo Radicchi: Center for Complex Networks and Systems Research, School of Informatics and Computing, Indiana University

Nature Communications, 2017, vol. 8, issue 1, 1-7

Abstract: Abstract 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.

Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
https://www.nature.com/articles/s41467-017-01442-2 Abstract (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nat:natcom:v:8:y:2017:i:1:d:10.1038_s41467-017-01442-2

Ordering information: This journal article can be ordered from
https://www.nature.com/ncomms/

DOI: 10.1038/s41467-017-01442-2

Access Statistics for this article

Nature Communications is currently edited by Nathalie Le Bot, Enda Bergin and Fiona Gillespie

More articles in Nature Communications from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().