The DOI matches its Crossref record; 30 of the 30 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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
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
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
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
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Threshold models of collective behavior
Granovetter, M. (1978) · American Journal of Sociology · doi:10.1086/226707 · Cited by 6,072
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
Research works printed but not linked: 2
- 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
- Bollobás, B. & Riordan, O. Percolation (Cambridge Univ. Press, 2006) · doi:10.1017/cbo9781139167383
Cited by
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
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-citationFrom hairballs to hypotheses–biological insights from microbial networks
Röttjers, L., & Faust, K. (2018) · FEMS Microbiology Reviews · doi:10.1093/femsre/fuy030 · Cited by 714
The H-index of a network node and its relation to degree and coreness
Lü, L., Zhou, T., Zhang, Q.-M., & Stanley, H. E. (2016) · Nature Communications · doi:10.1038/ncomms10168 · Cited by 690
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
Self-citationRandom walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
Dynamics of information diffusion and its applications on complex networks
Zhang, Z.-K., Liu, C., Zhan, X.-X., Lu, X., Zhang, C.-X., & Zhang, Y.-C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.07.002 · Cited by 484
Statistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
Measuring 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
Finding key players in complex networks through deep reinforcement learning
Fan, C., Zeng, L., Sun, Y., & Liu, Y.-Y. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0177-2 · Cited by 425
Unification of theoretical approaches for epidemic spreading on complex networks
Wang, W., Tang, M., Eugene Stanley, H., & Braunstein, L. A. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa5398 · Cited by 366
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
Identifying a set of influential spreaders in complex networks
Zhang, J.-X., Chen, D.-B., Dong, Q., & Zhao, Z.-D. (2016) · Scientific Reports · doi:10.1038/srep27823 · Cited by 320
Braunstein, A., Dall’Asta, L., Semerjian, G., & Zdeborová, L. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1605083113 · Cited by 301
Influence maximization in social networks based on discrete particle swarm optimization
Gong, M., Yan, J., Shen, B., Ma, L., & Cai, Q. (2016) · Information Sciences · doi:10.1016/j.ins.2016.07.012 · Cited by 297
Zhang, C., Fan, C., Yao, W., Hu, X., & Mostafavi, A. (2019) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2019.04.004 · Cited by 293
Coevolution spreading in complex networks
Wang, W., Liu, Q.-H., Liang, J., Hu, Y., & Zhou, T. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.07.001 · Cited by 286
Phase transitions in models of human cooperation
Perc, M. (2016) · Physics Letters A · doi:10.1016/j.physleta.2016.06.017 · Cited by 277
A Survey on Information Diffusion in Online Social Networks: Models and Methods
Li, M., Wang, X., Gao, K., & Zhang, S. (2017) · Information · doi:10.3390/info8040118 · Cited by 262
Identifying influential spreaders by gravity model
Li, Z., Ren, T., Ma, X., Liu, S., Zhang, Y., & Zhou, T. (2019) · Scientific Reports · doi:10.1038/s41598-019-44930-9 · Cited by 256
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-citationMitigation of cascading failures in complex networks
Smolyak, A., Levy, O., Vodenska, I., Buldyrev, S., & Havlin, S. (2020) · Scientific Reports · doi:10.1038/s41598-020-72771-4 · Cited by 67
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
- 30
- 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
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.