SearcharxivSearch

arXiv · 2212.05756

Finite range decompositions of Gaussian fields with applications to level-set percolation

Abstract

In a recent work (arXiv:2206.10724), Muirhead has studied level-set percolation of (discrete or continuous) Gaussian fields, and has shown sharpness of the associated phase transition under the assumption that the field has a certain multiscale white noise decomposition, a variant of a finite-range decomposition. We show that a large class of Gaussian fields have such a white noise decomposition with optimal decay parameter. Examples include the discrete Gaussian free field, the discrete membrane model, and the mollified continuous Gaussian free field. This answers various questions from Muirhead's paper. Our construction of the white-noise decomposition is a refinement of Bauerschmidt's construction of finite-range decomposition. In the continuous setting our construction is very similar to Bauerschmidt's, while in the discrete setting several new ideas are needed, including the use of a result by P\'olya and Szeg\H{o} on polynomials that take positive values on the positive real line.

Explore related subjects

Keep this discovery

BibTeXRIS

Florian Schweiger. 2022-12-12. Finite range decompositions of Gaussian fields with applications to level-set percolation. https://arxiv.org/abs/2212.05756

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