SearcharxivSearch

arXiv subjects

Andrew Heeszel

Publications and source records attributed to Andrew Heeszel.

3 recordsLinked to original sources

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

The contact process with avoidance is a 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 each edge is either active or inactive. Each infected vertex infects each healthy neighbor across each active edge at rate $\lambda$ and recovers at rate $1$, while each active edge pointing from an infected vertex to a healthy vertex becomes inactive at rate $\alpha$. 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}^d$, $d \geq 2$. We show that for every $d \geq 2$ and fixed $\alpha > 0$, there exist constants $\lambda(\alpha,d)^-$ and $\lambda(\alpha,d)^+$ such that for all $\lambda < \lambda(\alpha,d)^-$ the infection dies out almost surely while for all $\lambda > \lambda(\alpha,d)^+$ the infection persists indefinitely with positive probability. Furthermore, we show that both $\lambda(\alpha,d)^-$ and $\lambda(\alpha,d)^+$ scale like $1/d$ as $d \rightarrow \infty$ and that there exists a constant $C(\alpha)$ such that when $\lambda > C(\alpha)/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 $\alpha$ and transition from both isolated and infected to healthy at rate $1$.

math.PR

Limiting Speed and Fluctuations for the Boundary Modified Contact Process

The boundary modified contact process models an epidemic spreading in one dimension with two infection parameters, $\lambda_i$ and $\lambda_e$. Starting from a finite infected set, each edge of $\mathbb{Z}$ transmits the infection at rate $\lambda_i$ except for the rightmost and leftmost edges incident to infected vertices, which transmit the infection at rate $\lambda_e$. We show a strong law of large numbers and central limit theorem for the location of the rightmost infected vertex when $\lambda_i = \lambda_c$ and $\lambda_e = \lambda_c + \varepsilon$. We also show stretched exponential tail bounds in the fluctuations of the rightmost infected vertex, the extinction time of the process on the event of non-survival, and the probability of survival given the size of the initial infected region. Our results extend to the boundary modified contact process whenever $\lambda_c \leq \lambda_i < \lambda_e$, and solves an open problem first proposed by Andjel and Rolla in [1].

math.PR

Cutoff for Contingency Table and Torus Random Walks with Low Incremental Correlations

We use the correlation matrix of the generating distribution to determine the mixing time for random walks on the torus $(\mathbb{Z}/q\mathbb{Z})^n$. We present our method in the context of the Diaconis-Gangolli random walk on both the $1 \times n$ and $m \times n$ contingency tables over $\mathbb{Z}/q\mathbb{Z}$. In the $1 \times n$ case, we prove that the random walk exhibits cutoff at time $\dfrac{n q^2 \log(n)}{8 \pi^2}$ when $q \gg n$; in the $m \times n$ case, where $m, n$ are of the same order, we establish cutoff for the random walk at time $\dfrac{mn q^2 \log(mn)}{16 \pi^2}$ when $q \gg n^2$. Our method reveals that a general class of random walks on the torus $(\mathbb{Z}/q\mathbb{Z})^n$ has cutoff. If each coordinate of the lifted random walk onto $\mathbb{Z}^n$ has variance $\sigma^2/n$ in each jump, and the between-coordinate correlations are sufficiently low, then cutoff occurs at time $\dfrac{nq^2 \log(n)}{4\pi^2 \sigma^2}$.

math.PR