{"title":"Optimal curing rate allocation in the SIS epidemic model","authors":"Ryan McFadden, Fraser Daly, Seva Shneer","doi":"10.1016/j.spl.2024.110284","DOIUrl":null,"url":null,"abstract":"<div><div>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, <span><math><mi>Δ</mi></math></span>, 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 <span><math><mi>∞</mi></math></span> 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 <span><math><mi>Δ</mi></math></span> is optimal in some situations, it is typically not optimal, even for regular graphs.</div></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167715224002530","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.