IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1008052.html
   My bibliography  Save this article

Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities

Author

Listed:
  • Doina Bucur
  • Petter Holme

Abstract

Identifying important nodes for disease spreading is a central topic in network epidemiology. We investigate how well the position of a node, characterized by standard network measures, can predict its epidemiological importance in any graph of a given number of nodes. This is in contrast to other studies that deal with the easier prediction problem of ranking nodes by their epidemic importance in given graphs. As a benchmark for epidemic importance, we calculate the exact expected outbreak size given a node as the source. We study exhaustively all graphs of a given size, so do not restrict ourselves to certain generative models for graphs, nor to graph data sets. Due to the large number of possible nonisomorphic graphs of a fixed size, we are limited to ten-node graphs. We find that combinations of two or more centralities are predictive (R2 scores of 0.91 or higher) even for the most difficult parameter values of the epidemic simulation. Typically, these successful combinations include one normalized spectral centrality (such as PageRank or Katz centrality) and one measure that is sensitive to the number of edges in the graph.Author summary: A central challenge in network epidemiology is to find nodes that are important for disease spreading. Usually, one starts from a certain graph, and tries to rank the nodes in a way that correlates as strongly as possible with measures of importance estimated using simulations of outbreaks. A more challenging prediction task, and the one we take, is to ask if one can guess, from measures of the network structure alone, the values of quantities describing the outbreak. Having this predictive power is important: one can then target nodes that are more important than a certain threshold, rather than just a top fraction of nodes. By exhaustively studying all small graphs, we show that such prediction is possible to achieve with high accuracy by combining standard network measures.

Suggested Citation

  • Doina Bucur & Petter Holme, 2020. "Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities," PLOS Computational Biology, Public Library of Science, vol. 16(7), pages 1-20, July.
  • Handle: RePEc:plo:pcbi00:1008052
    DOI: 10.1371/journal.pcbi.1008052
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1008052
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1008052&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1008052?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Samuel V. Scarpino & Giovanni Petri, 2019. "On the predictability of infectious disease outbreaks," Nature Communications, Nature, vol. 10(1), pages 1-8, December.
    2. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    3. Miller, Joel C. & Hyman, James M., 2007. "Effective vaccination strategies for realistic social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 386(2), pages 780-785.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sun, Peng Gang & Che, Wanping & Quan, Yining & Wang, Shuzhen & Miao, Qiguang, 2022. "Random networks are heterogeneous exhibiting a multi-scaling law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 587(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liang, Wei & Shi, Yuming & Huang, Qiuling, 2014. "Modeling the Chinese language as an evolving network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 268-276.
    2. Yulan Li & Kun Ma, 2022. "A Hybrid Model Based on Improved Transformer and Graph Convolutional Network for COVID-19 Forecasting," IJERPH, MDPI, vol. 19(19), pages 1-17, September.
    3. Yan Qiang & Bo Pei & Weili Wu & Juanjuan Zhao & Xiaolong Zhang & Yue Li & Lidong Wu, 2014. "Improvement of path analysis algorithm in social networks based on HBase," Journal of Combinatorial Optimization, Springer, vol. 28(3), pages 588-599, October.
    4. Pi, Xiaochen & Tang, Longkun & Chen, Xiangzhong, 2021. "A directed weighted scale-free network model with an adaptive evolution mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    5. Stephanie Rend'on de la Torre & Jaan Kalda & Robert Kitt & Juri Engelbrecht, 2016. "On the topologic structure of economic complex networks: Empirical evidence from large scale payment network of Estonia," Papers 1602.04352, arXiv.org.
    6. Yoshiharu Maeno & Kenji Nishiguchi & Satoshi Morinaga & Hirokazu Matsushima, 2014. "Impact of credit default swaps on financial contagion," Papers 1411.1356, arXiv.org.
    7. Rabbani, Fereshteh & Khraisha, Tamer & Abbasi, Fatemeh & Jafari, Gholam Reza, 2021. "Memory effects on link formation in temporal networks: A fractional calculus approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(C).
    8. Gabrielle Demange, 2012. "On the influence of a ranking system," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 431-455, July.
    9. Cheng, Ranran & Peng, Mingshu & Yu, Weibin, 2014. "Pinning synchronization of delayed complex dynamical networks with nonlinear coupling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 413(C), pages 426-431.
    10. Tsao, J.Y. & Boyack, K.W. & Coltrin, M.E. & Turnley, J.G. & Gauster, W.B., 2008. "Galileo's stream: A framework for understanding knowledge production," Research Policy, Elsevier, vol. 37(2), pages 330-352, March.
    11. Pier Paolo Saviotti, 2011. "Knowledge, Complexity and Networks," Chapters, in: Cristiano Antonelli (ed.), Handbook on the Economic Complexity of Technological Change, chapter 6, Edward Elgar Publishing.
    12. Duan, Shuyu & Wen, Tao & Jiang, Wen, 2019. "A new information dimension of complex network based on Rényi entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 529-542.
    13. Sanjeev Goyal & Marco J. van der Leij & José Luis Moraga-Gonzalez, 2006. "Economics: An Emerging Small World," Journal of Political Economy, University of Chicago Press, vol. 114(2), pages 403-432, April.
    14. Silva, F.N. & Viana, M.P. & Travençolo, B.A.N. & Costa, L. da F., 2011. "Investigating relationships within and between category networks in Wikipedia," Journal of Informetrics, Elsevier, vol. 5(3), pages 431-438.
    15. Dávid Csercsik & Sándor Imre, 2017. "Cooperation and coalitional stability in decentralized wireless networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(4), pages 571-584, April.
    16. Cooper, Ian & Mondal, Argha & Antonopoulos, Chris G., 2020. "Dynamic tracking with model-based forecasting for the spread of the COVID-19 pandemic," Chaos, Solitons & Fractals, Elsevier, vol. 139(C).
    17. Cooper, Ian & Mondal, Argha & Antonopoulos, Chris G., 2020. "A SIR model assumption for the spread of COVID-19 in different communities," Chaos, Solitons & Fractals, Elsevier, vol. 139(C).
    18. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    19. Sun, Bingbin & Yao, Jialing & Xi, Lifeng, 2019. "Eigentime identities of fractal sailboat networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 338-349.
    20. Martins, Adriel M.F. & Fernandes, Leonardo H.S. & Nascimento, Abraão D.C., 2023. "Scientific progress in information theory quantifiers," Chaos, Solitons & Fractals, Elsevier, vol. 170(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pcbi00:1008052. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.