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

Epidemic Spreading on Preferred Degree Adaptive Networks

Author

Listed:
  • Shivakumar Jolad
  • Wenjia Liu
  • B Schmittmann
  • R K P Zia

Abstract

We study the standard SIS model of epidemic spreading on networks where individuals have a fluctuating number of connections around a preferred degree . Using very simple rules for forming such preferred degree networks, we find some unusual statistical properties not found in familiar Erdös-Rényi or scale free networks. By letting depend on the fraction of infected individuals, we model the behavioral changes in response to how the extent of the epidemic is perceived. In our models, the behavioral adaptations can be either ‘blind’ or ‘selective’ – depending on whether a node adapts by cutting or adding links to randomly chosen partners or selectively, based on the state of the partner. For a frozen preferred network, we find that the infection threshold follows the heterogeneous mean field result and the phase diagram matches the predictions of the annealed adjacency matrix (AAM) approach. With ‘blind’ adaptations, although the epidemic threshold remains unchanged, the infection level is substantially affected, depending on the details of the adaptation. The ‘selective’ adaptive SIS models are most interesting. Both the threshold and the level of infection changes, controlled not only by how the adaptations are implemented but also how often the nodes cut/add links (compared to the time scales of the epidemic spreading). A simple mean field theory is presented for the selective adaptations which capture the qualitative and some of the quantitative features of the infection phase diagram.

Suggested Citation

  • Shivakumar Jolad & Wenjia Liu & B Schmittmann & R K P Zia, 2012. "Epidemic Spreading on Preferred Degree Adaptive Networks," PLOS ONE, Public Library of Science, vol. 7(11), pages 1-11, November.
  • Handle: RePEc:plo:pone00:0048686
    DOI: 10.1371/journal.pone.0048686
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0048686
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0048686&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0048686?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
    ---><---

    Citations

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


    Cited by:

    1. David Lambert & Fabio Vanni, 2017. "Complexity and Heterogeneity in a Dynamic Network," LEM Papers Series 2017/22, Laboratory of Economics and Management (LEM), Sant'Anna School of Advanced Studies, Pisa, Italy.
    2. Lambert, David & Vanni, Fabio, 2018. "Complexity and heterogeneity in a dynamic network," Chaos, Solitons & Fractals, Elsevier, vol. 108(C), pages 94-103.
    3. Zhou, Li-xin & Lin, Jie & Wang, Yu-qing & Li, Yan-feng & Miao, Run-sheng, 2018. "Critical phenomena of spreading dynamics on complex networks with diverse activity of nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 509(C), pages 439-447.

    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:pone00:0048686. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.