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

Optimal curing rate allocation in the SIS epidemic model

Author

Listed:
  • McFadden, Ryan
  • Daly, Fraser
  • Shneer, Seva

Abstract

We consider a susceptible-infected-susceptible (SIS) epidemic model on an undirected graph, with a homogeneous infection rate and heterogeneous curing rates. We set an overall network curing rate, Δ, and study optimal allocation of curing rates to nodes, in terms of the expected time to the extinction of the epidemic. As other parameters are fixed, we study these allocations as the infection rate tends to 0 and ∞ in both regular and non-regular graphs. We further illustrate this optimisation with some numerical examples. Our findings demonstrate that, while the uniform split of Δ is optimal in some situations, it is typically not optimal, even for regular graphs.

Suggested Citation

  • McFadden, Ryan & Daly, Fraser & Shneer, Seva, 2025. "Optimal curing rate allocation in the SIS epidemic model," Statistics & Probability Letters, Elsevier, vol. 216(C).
  • Handle: RePEc:eee:stapro:v:216:y:2025:i:c:s0167715224002530
    DOI: 10.1016/j.spl.2024.110284
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715224002530
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spl.2024.110284?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. Kimon Drakopoulos & Asuman Ozdaglar & John N. Tsitsiklis, 2017. "When Is a Network Epidemic Hard to Eliminate?," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 1-14, January.
    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. Daron Acemoglu & Ali Makhdoumi & Azarakhsh Malekian & Asuman Ozdaglar, 2024. "Testing, Voluntary Social Distancing, and the Spread of an Infection," Operations Research, INFORMS, vol. 72(2), pages 533-548, March.
    2. Kang Kang & Sherwin Doroudi & Mohammad Delasay & Alexander Wickeham, 2023. "A queueing‐theoretic framework for evaluating transmission risks in service facilities during a pandemic," Production and Operations Management, Production and Operations Management Society, vol. 32(5), pages 1453-1470, May.

    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:stapro:v:216:y:2025:i:c:s0167715224002530. 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.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.