SearcharxivSearch

arXiv · 2107.01878

Percolation transition for random forests in $d\geq 3$

Abstract

The arboreal gas is the probability measure on (unrooted spanning) forests of a graph in which each forest is weighted by a factor $\beta>0$ per edge. It arises as the $q\to 0$ limit of the $q$-state random cluster model with $p=\beta q$. We prove that in dimensions $d\geq 3$ the arboreal gas undergoes a percolation phase transition. This contrasts with the case of $d=2$ where no percolation transition occurs. The starting point for our analysis is an exact relationship between the arboreal gas and a non-linear sigma model with target space the fermionic hyperbolic plane $\mathbb{H}^{0|2}$. This latter model can be thought of as the $0$-state Potts model, with the arboreal gas being its random cluster representation. Unlike the standard Potts models, the $\mathbb{H}^{0|2}$ model has continuous symmetries. By combining a renormalisation group analysis with Ward identities we prove that this symmetry is spontaneously broken at low temperatures. In terms of the arboreal gas, this symmetry breaking translates into the existence of infinite trees in the thermodynamic limit. Our analysis also establishes massless free field correlations at low temperatures and the existence of a macroscopic tree on finite tori.

Explore related subjects

Keep this discovery

BibTeXRIS

Roland Bauerschmidt, Nicholas Crawford, Tyler Helmuth. 2021-07-05. Percolation transition for random forests in $d\geq 3$. https://doi.org/10.1007/s00222-024-01263-3

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