SearcharxivSearch

arXiv · 2412.17768

Critical level set percolation for the GFF in $d>6$: comparison principles and some consequences

Abstract

The intrinsic geometry of the critical percolation cluster induced by the level set of the metric Gaussian free field on $\mathbb{Z}^{d}$ has been the subject of much recent activity. (Lupu, 2016) established that the critical percolation cluster has the same law as that in a Poisson loop soup where the intensity is dictated by the Green's function of the usual random walk. A sharp Euclidean one arm exponent was proven recently in (Cai and Ding, 2023), and subsequently in (Ganguly and Nam, 2024) other results about the chemical one arm exponent, volume growth and the Alexander-Orbach conjecture were established for all $d>20.$ In this article, we introduce new methods to obtain several sharp estimates about the intrinsic geometry which hold for all $d>6$. We develop two primary comparison methods. The first involves a comparison of the extrinsic (Euclidean) and intrinsic metrics allowing estimates about the former to be transferrable to the latter. The second compares intrinsic geodesics to a class of modified paths which are non-backtracking in a certain loop sense. The latter is amenable to analysis using methods of bond percolation. We finally prove that such non-backtracking paths are not much longer than geodesics allowing us to establish comparable estimates for the geodesic. As applications of such methods, we establish, for all $d>6,$ the chemical one-arm exponent, as well as an averaged version of a conjecture from (Werner, 2021) which asserts that deletion of loops with diameter larger than $r^{6/d}$ do not affect the connection probabilities between points at Euclidean distance $r.$ An important ingredient of independent interest is a local connectivity estimate which asserts that the connection probability between two points at distance $r$ remains, up to constants, unchanged even if the connecting path is confined to a ball of diameter comparable to $r.$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shirshendu Ganguly, Kaihao Jing. 2024-12-23. Critical level set percolation for the GFF in $d>6$: comparison principles and some consequences. https://arxiv.org/abs/2412.17768

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