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
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
Identification of influential spreaders in complex networks
Kitsak, M., Gallos, L. K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H. E., & Makse, H. A. (2010) · Nature Physics · doi:10.1038/nphys1746 · Cited by 3,212
Self-citationA simple model of global cascades on random networks
Watts, D. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.082090499 · Cited by 2,673
Mining knowledge-sharing sites for viral marketing
Richardson, M., & Domingos, P. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775057 · Cited by 1,612
Breakdown of the Internet under Intentional Attack
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3682 · Cited by 1,455
Spectral redemption in clustering sparse networks
Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., & Zhang, P. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1312486110 · Cited by 638
Spectral methods for community detection and graph partitioning
Newman, M. E. J. (2013) · Physical Review E · doi:10.1103/physreve.88.042822 · Cited by 424
The Cavity Method at Zero Temperature
Mézard, M., & Parisi, G. (2003) · Journal of Statistical Physics · doi:10.1023/a:1022221005097 · Cited by 367
Searching for superspreaders of information in real-world social media
Pei, S., Muchnik, L., Andrade, Zheng, Z., & Makse, H. A. (2014) · Scientific Reports · doi:10.1038/srep05547 · Cited by 362
Self-citationOptimization with Extremal Dynamics
Boettcher, S., & Percus, A. G. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5211 · Cited by 342
Percolation on Sparse Networks
Karrer, B., Newman, M. E. J., & Zdeborová, L. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.208702 · Cited by 303
Finding a Better Immunization Strategy
Chen, Y., Paul, G., Havlin, S., Liljeros, F., & Stanley, H. E. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.058701 · Cited by 298
Searching for superspreaders of information in real-world social media
Pei, S., Muchnik, L., Andrade, Jr., Zheng, Z. M., & Makse, H. A. (2014) · CUNY Academic Works (City University of New York) · Cited by 265
Self-citationZeta Functions of Finite Graphs and Representations of $p$-Adic Groups
Hashimoto, K.-I. (2018) · Advanced Studies in Pure Mathematics · doi:10.2969/aspm/01510211 · Cited by 255
Spreading dynamics in complex networks
Pei, S., & Makse, H. A. (2013) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2013/12/p12002 · Cited by 252
Self-citationMultiple percolation transitions in a configuration model of a network of networks
Bianconi, G., & Dorogovtsev, S. N. (2014) · Physical Review E · doi:10.1103/physreve.89.062814 · Cited by 176
Containing Epidemic Outbreaks by Message-Passing Techniques
Altarelli, F., Braunstein, A., Dall’Asta, L., Wakeling, J. R., & Zecchina, R. (2014) · Physical Review X · doi:10.1103/physrevx.4.021024 · Cited by 153
Predicting percolation thresholds in networks
Radicchi, F. (2015) · Physical Review E · doi:10.1103/physreve.91.010801 · Cited by 115
Optimizing spread dynamics on graphs by message passing
Altarelli, F., Braunstein, A., Dall’Asta, L., & Zecchina, R. (2013) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2013/09/p09011 · Cited by 100
The non-backtracking spectrum of the universal cover of a graph
Angel, O., Friedman, J., & Hoory, S. (2014) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-2014-06255-7 · Cited by 88
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-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
- 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.