SIR epidemics on evolving graphs
classification
🧮 math.PR
keywords
epidemiclargedelsirevosirfinalgraphslambdamodel
read the original abstract
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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.