Evidence map›Paper›PMID 29147014›Full record

ArticleNature communications2017

Optimal percolation on multiplex networks.

Saeed Osat, Ali Faqeeh, Filippo Radicchi

Abstract read
In one paragraph

Article in Nature communications, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 17 papers.

0numbers the graph read from it
0cells of the map it votes in
17citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

17 citing papers in PubMed.

  1. Article
  2. Article
  3. Cross-feeding creates tipping points in microbiome diversity.Proceedings of the National Academy of Sciences of the United States of America · 2025
    Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Influence maximization in Boolean networks.Nature communications · 2022
    Article
  11. Article
  12. Article
  13. Article
  14. Review
  15. Article
  16. Article
  17. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Saeed OsatMolecular Simulation Laboratory, Department of Physics, Faculty of Basic Sciences, Azarbaijan Shahid Madani University, Tabriz, 53714-161, Iran.
Ali FaqeehCenter for Complex Networks and Systems Research, School of Informatics and Computing, Indiana University, Bloomington, IN, 47408, USA.
Filippo RadicchiCenter for Complex Networks and Systems Research, School of Informatics and Computing, Indiana University, Bloomington, IN, 47408, USA. filiradi@indiana.edu.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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.

Identifiers

PMID29147014
PMCPMC5691044

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.