SearcharxivSearch

arXiv · 2206.10724

Percolation of strongly correlated Gaussian fields II. Sharpness of the phase transition

Abstract

We establish the sharpness of the phase transition for a wide class of Gaussian percolation models, on $\mathbb{Z}^d$ or $\mathbb{R}^d$, $d \ge 2$, with correlations decaying at least algebraically with exponent $\alpha > 0$, including the discrete Gaussian free field ($d \ge 3, \alpha = d-2$), the discrete Gaussian membrane model ($d \ge 5, \alpha = d - 4$), and many other examples both discrete and continuous. In particular we do not assume positive correlations. This result is new for all strongly correlated models (i.e. $\alpha \in (0,d]$) in dimension $d \ge 3$ except the Gaussian free field, for which sharpness was proven in a recent breakthrough by Duminil-Copin, Goswami, Rodriguez and Severo; even then, our proof is simpler and yields new near-critical information on the percolation density. For planar fields which are continuous and positively-correlated, we establish sharper bounds on the percolation density by exploiting a new `weak mixing' property for strongly correlated Gaussian fields. As a byproduct we establish the box-crossing property for the nodal set, of independent interest. This is the second in a series of two papers studying level-set percolation of strongly correlated Gaussian fields, which can be read independently.

Explore related subjects

Keep this discovery

BibTeXRIS

Stephen Muirhead. 2022-06-21. Percolation of strongly correlated Gaussian fields II. Sharpness of the phase transition. https://arxiv.org/abs/2206.10724

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