Epidemics with avoidance and isolation on $\mathbb{Z}^d$

Abstract: The contact process with avoidance is generalization of the classical contact process (SIS epidemic) that introduces a mechanism for healthy individuals to avoid their infected neighbors. Let $G$ be a directed graph. At each time $t$, each vertex is either healthy or infected and edge edge is either active or inactive. Each infected vertex infects each healthy neighbor across each active edge at rate $λ$ and recovers at rate $1$ while each active edge pointing from an infected vertex to a healthy vertex becomes inactive at rate $α$. An inactive edge becomes active when its tail vertex recovers. This model has been previously studied on $\mathbb{Z}$, the $n$-cycle $\mathbb{Z}_n$, and the $n$-star graph; here we extend the study of this model to lattices $\mathbb{Z}<sup>d$, $d \geq 2$. We show that for every $d \geq 2$ and fixed $α&gt; 0$, there exist constants $λ(α,d)<sup>-$ and $λ(α,d)<sup>+$ such that for all $λ&lt; λ(α,d)<sup>-$ the infection dies out almost surely while for all $λ&gt; λ(α,d)<sup>+$ the infection persists indefinitely with positive probability. Furthermore, we show that both $λ(α,d)<sup>-$ and $λ(α,d)<sup>+$ scale like $1/d$ as $d \rightarrow \infty$ and that there exists a constant $C(α)$ such that when $λ&gt; C(α)/d$ the process has a nontrivial invariant measure for $d$ sufficiently large. Our methods and most of our results also apply to the SIRS model and a related model in which infected vertices enter an isolated state at rate $α$ and transition from both isolated and infected to healthy at rate $1$.