The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Influence maximization in complex networks through optimal percolation
Open accessAbstract
The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Research works printed but not linked: 26
- Domingos, P. & Richardson, M. Mining knowledge-sharing sites for viral marketing. In Proc. 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 61–70 (ACM, 2002); http://dx.doi.org/10.1145/775047.775057 · DOI · Paper page
- Pastor-Satorras, R. & Vespignani, A. Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86, 3200–3203 (2001) · DOI · Paper page
- Newman, M. E. J. Spread of epidemic disease on networks. Phys. Rev. E 66, 016128 (2002) · DOI · Paper page
- Kempe, D., Kleinberg, J. & Tardos, E. Maximizing the spread of influence through a social network. In Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 137–143 (ACM, 2003); http://dx.doi.org/10.1145/956750.956769 · DOI · Paper page
- Kleinberg, J. Authoritative sources in a hyperlinked environment. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms (1998); J. Assoc. Comput. Machinery 46, 604–632 (1999) · DOI · Paper page
- Cohen, R., Erez, K., ben-Avraham, D. & Havlin, S. Breakdown of the Internet under intentional attack. Phys. Rev. Lett. 86, 3682–3685 (2001) · DOI · Paper page
- Chen, Y., Paul, G., Havlin, S., Liljeros, F. & Stanley, H. E. Finding a better immunization strategy. Phys. Rev. Lett. 101, 058701 (2008) · DOI · Paper page
- Kitsak, M. et al. Identification of influential spreaders in complex networks. Nature Phys. 6, 888–893 (2010) · DOI · Paper page
- Altarelli, F., Braunstein, A., Dall’Asta, L. & Zecchina, R. Optimizing spread dynamics on graphs by message passing. J. Stat. Mech. P09011 (2013) · DOI
- Altarelli, F., Braunstein, A., Dall’Asta, L., Wakeling, J. R. & Zecchina, R. Containing epidemic outbreaks by message-passing techniques. Phys. Rev. X 4, 021024 (2014)
- Hashimoto, K. Zeta functions of finite graphs and representations of p-adic groups. Adv. Stud. Pure Math. 15, 211–280 (1989) · DOI · Paper page
- Coja-Oghlan, A., Mossel, E. & Vilenchik, D. A spectral approach to analyzing belief propagation for 3-coloring. Combin. Probab. Comput. 18, 881–912 (2009) · doi:10.1017/s096354830900981x
- Granovetter, M. Threshold models of collective behavior. Am. J. Sociol. 83, 1420–1443 (1978) · DOI · Paper page
- Watts, D. J. A simple model of global cascades on random networks. Proc. Natl Acad. Sci. USA 99, 5766–5771 (2002) · DOI · Paper page
- Pei, S., Muchnik, L., Andrade, J. S., Jr, Zheng, Z. & Makse, H. A. Searching for superspreaders of information in real-world social media. Sci. Rep. 4, 5547 (2014) · DOI · Paper page
- Pei, S. & Makse, H. A. Spreading dynamics in complex networks. J. Stat. Mech. P12002 (2013) · DOI · Paper page
- Bollobás, B. & Riordan, O. Percolation (Cambridge Univ. Press, 2006) · doi:10.1017/cbo9781139167383
- Bianconi, G. & Dorogovtsev, S. N. Multiple percolation transitions in a configuration model of network of networks. Phys. Rev. E 89, 062814 (2014) · DOI · Paper page
- Karrer, B., Newman, M. E. J. & Zdeborová, L. Percolation on sparse networks. Phys. Rev. Lett. 113, 208–702 (2014) · DOI · Paper page
- Angel, O., Friedman, J. & Hoory, S. The non-backtracking spectrum of the universal cover of a graph. Trans. Am. Math. Soc. 367, 4287–4318 (2015) · DOI
- Krzakala, F. et al. Spectral redemption in clustering sparse networks. Proc. Natl Acad. Sci. USA 110, 20935–20940 (2013) · DOI · Paper page
- Newman, M. E. J. Spectral methods for community detection and graph partitioning. Phys. Rev. E 88, 042822 (2013) · DOI · Paper page
- Radicchi, F. Predicting percolation thresholds in networks. Phys. Rev. E 91, 010801(R) (2015) · DOI
- Mézard, M. & Parisi, G. The cavity method at zero temperature. J. Stat. Phys. 111, 1–34 (2003) · DOI · Paper page
- Boettcher, S. & Percus, A. G. Optimization with extremal dynamics. Phys. Rev. Lett. 86, 5211–5214 (2001) · DOI · Paper page
- Granovetter, M. The strength of weak ties. Am. J. Sociol. 78, 1360–1380 (1973) · DOI · Paper page
Cited by
Influence of fake news in Twitter during the 2016 US presidential election
Bovet, A., & Makse, H. A. (2019) · Nature Communications · doi:10.1038/s41467-018-07761-2 · Cited by 701
Self-citationMeasuring user influence on Twitter: A survey
Riquelme, F., & González-Cantergiani, P. (2016) · Information Processing & Management · doi:10.1016/j.ipm.2016.04.003 · Cited by 429
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Information cascades in complex networks
Jalili, M., & Perc, M. (2017) · Journal of Complex Networks · doi:10.1093/comnet/cnx019 · Cited by 248
Flamino, J., Galeazzi, A., Feldman, S., Macy, M. W., Cross, B., Zhou, Z., Serafino, M., Bovet, A., Makse, H. A., & Szymanski, B. K. (2023) · Nature Human Behaviour · doi:10.1038/s41562-023-01550-8 · Cited by 113
Self-citation
Metadata
- Authors
- Morone, F., & Makse, H. A.
- Venue
- Nature
- Published
- 2015-07-01
- Volume
- 524
- Issue
- 7563
- Pages
- 65-68
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1931400479
- Cited by
- 1,230
- References
- 4
- FWCI
- 72.27
- Type
- journal article
- Language
- en
- Update notices
- erratum (2015-10-28)
- Open access
- green
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Influence maximization in complex networks through optimal percolation. https://app.cochat.ai/papers/10.1038/nature14604
- The paper
- Morone, F., & Makse, H. A. (2015). Influence maximization in complex networks through optimal percolation. Nature. https://doi.org/10.1038/nature14604
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
