SearcharxivSearch

arXiv · 2312.10030

Arm exponent for the Gaussian free field on metric graphs in intermediate dimensions

Abstract

We investigate the bond percolation model on transient weighted graphs ${G}$ induced by the excursion sets of the Gaussian free field on the corresponding metric graph. We assume that balls in ${G}$ have polynomial volume growth with growth exponent $\alpha $ and that the Green's function for the random on ${G}$ exhibits a power law decay with exponent $\nu $, in the regime $1\leq \nu \leq \frac{\alpha}{2}$. In particular, this includes the cases of ${G}=\mathbb{Z}^{3}$ for which $\nu =1$, and ${G}= \mathbb{Z}^{4}$ for which $\nu =\frac{\alpha}{2}=2$. For all such graphs, we determine the leading-order asymptotic behavior for the critical one-arm probability, which we prove decays with distance $R$, like $R^{-\frac{\nu}{2}+o(1)}$. Our results are, in fact, more precise and yield logarithmic corrections when $\nu >1$ as well as corrections of order $\log \log R$ when $\nu =1$. We further obtain very sharp upper bounds on truncated two-point functions close to criticality, which are new when $\nu >1$ and essentially optimal when $\nu =1$. This extends previous results from arXiv:2101.05801 and arXiv:1807.11117.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Drewitz, Alexis Prévost, Pierre-François Rodriguez. 2023-12-15. Arm exponent for the Gaussian free field on metric graphs in intermediate dimensions. https://arxiv.org/abs/2312.10030

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