IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v540y2020ics0378437119318096.html
   My bibliography  Save this article

Prevalence expansion in NIMFA

Author

Listed:
  • He, Zhidong
  • Van Mieghem, Piet

Abstract

The N-Intertwined Mean Field Approximation (NIMFA) is a reasonably accurate approximation of the exact SIS epidemic process on a network. The average fraction of infected nodes in the NIMFA steady state, also called the steady-state prevalence, in terms of the effective infection rate can be expanded into a power series around the NIMFA epidemic threshold. In this paper, we investigate the convergence of the steady-state prevalence Taylor expansion. We determine the radius of convergence in some special types of graphs. We also show that the radius of convergence of the steady-state prevalence expansion depends upon the network topology, in particular, the average degree of the network and the spectral gap of the adjacency matrix play a role.

Suggested Citation

  • He, Zhidong & Van Mieghem, Piet, 2020. "Prevalence expansion in NIMFA," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    • Handle: RePEc:eee:phsmap:v:540:y:2020:i:c:s0378437119318096
    DOI: 10.1016/j.physa.2019.123220
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437119318096
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2019.123220?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. He, Zhidong & Van Mieghem, Piet, 2018. "The spreading time in SIS epidemics on networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 494(C), pages 317-330.
    Full references (including those not matched with items on IDEAS)

    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. Wu, Qingchu & Zhou, Rong & Hadzibeganovic, Tarik, 2019. "Conditional quenched mean-field approach for recurrent-state epidemic dynamics in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 518(C), pages 71-79.

    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:eee:phsmap:v:540:y:2020:i:c:s0378437119318096. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.