arXiv:1901.06568 [math.PR]AbstractReferencesReviewsResources
SIR epidemics on evolving graphs
Yufeng Jiang, Remy Kassem, Grayson York, Matthew Junge, Rick Durrett
Published 2019-01-19Version 1
We consider evoSIR, a variant of the SIR model, on Erd\H os-Renyi random graphs in which susceptibles with an infected neighbor break that connection at rate $\rho$ and rewire to a randomly chosen individual. We compute the critical infection rate $\lambda_c$ and the probability of a large epidemic by showing that they are the same for the delSIR model in which $S-I$ connections are deleted instead of rewired. The final size of a large delSIR epidemic has a continuous transition. Simulations suggest that the final size of a large evoSIR epidemic is discontinuous at $\lambda_c$.
Related articles: Most relevant | Search more
arXiv:2003.08534 [math.PR] (Published 2020-03-19)
Epidemics on Evolving Graphs
arXiv:1107.1532 [math.PR] (Published 2011-07-07)
SIR epidemics on a scale-free spatial nested modular network with a non-trivial threshold
arXiv:1802.05011 [math.PR] (Published 2018-02-14)
SIR epidemics and vaccination on random graphs with clustering