SearcharxivSearch

arXiv · 1912.09825

On the threshold of spread-out contact process percolation

Abstract

We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $\mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one infected sites recover, and with rate $\lambda$ they transmit the infection to some other vertex chosen uniformly within a ball of radius $R$. The classical phase transition result for this process states that there is a critical value $\lambda_c(R)$ such that the process has a non-trivial stationary distribution if and only if $\lambda > \lambda_c(R)$. In configurations sampled from this stationary distribution, we study nearest-neighbor site percolation of the set of infected sites; the associated percolation threshold is denoted $\lambda_p(R)$. We prove that $\lambda_p(R)$ converges to $1/(1-p_c)$ as $R$ tends to infinity, where $p_c$ is the threshold for Bernoulli site percolation on $\mathbb{Z}^d$. As a consequence, we prove that $\lambda_p(R) > \lambda_c(R)$ for large enough $R$, answering an open question of Liggett and Steif in the spread-out case.

Explore related subjects

Keep this discovery

BibTeXRIS

Balazs Rath, Daniel Valesin. 2019-12-20. On the threshold of spread-out contact process percolation. https://arxiv.org/abs/1912.09825

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR