SearcharxivSearch

arXiv · 1808.01277

Decoupling inequalities and supercritical percolation for the vacant set of random walk loop soup

Abstract

It has been recently understood (arXiv:1212.2885, arXiv:1310.4764, arXiv:1410.0605) that for a general class of percolation models on $\mathbb{Z}^d$ satisfying suitable decoupling inequalities, which includes i.a.\ Bernoulli percolation, random interlacements and level sets of the Gaussian free field, large scale geometry of the unique infinite cluster in strongly percolative regime is qualitatively the same; in particular, the random walk on the infinite cluster satisfies the quenched invariance principle, Gaussian heat-kernel bounds and local CLT. In this paper we consider the random walk loop soup on $\mathbb{Z}^d$ in dimensions $d\geq 3$. An interesting aspect of this model is that despite its similarity and connections to random interlacements and the Gaussian free field, it does not fall into the above mentioned general class of percolation models, since the required decoupling inequalities are not valid. We identify weaker (and more natural) decoupling inequalities and prove that (a) they do hold for the random walk loop soup and (b) all the results about the large scale geometry of the infinite percolation cluster proved for the above mentioned class of models hold also for models that satisfy the weaker decoupling inequalities. Particularly, all these results are new for the vacant set of the random walk loop soup. (The range of the random walk loop soup has been addressed by Chang arXiv:1504.07906 by a model specific approximation method, which does not apply to the vacant set.) Finally, we prove that the strongly supercritical regime for the vacant set of the random walk loop soup is non-trivial. It is expected, but open at the moment, that the strongly supercritical regime coincides with the whole supercritical regime.

Explore related subjects

Keep this discovery

BibTeXRIS

Caio Alves, Artem Sapozhnikov. 2018-08-03. Decoupling inequalities and supercritical percolation for the vacant set of random walk loop soup. https://arxiv.org/abs/1808.01277

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