Speed of the random walk on the supercritical Gaussian Free Field percolation on regular trees

MaRDI QIDQ6433432zbMATH OpenFDO

Authors Guillaume Conchon-Kerjan

Publication date 17 April 2023

Mathematics Subject Classification ID

Gaussian processes (60G15) Sums of independent random variables; random walks (60G50) Functional limit theorems; invariance principles (60F17) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: In this paper, we study the random walk on a supercritical branching process with an uncountable and unbounded set of types supported on the $d$-regular tree $mathbb{T}_d$ ($dgeq3$), namely the cluster $mathcal{C}_{c}ir{c}^h$ of the root in the level set of the Gaussian Free Field (GFF) above an arbitrary value $hin(-infty,h_{star})$. The value $h_{star}in(0,infty)$ is the percolation threshold; in particular, $mathcal{C}_{c}ir{c}^h$ is infinite with positive probability. We show that on $mathcal{C}_{c}ir{c}^h$ conditioned to be infinite, the simple random walk is ballistic, and we give a law of large numbers and a Donsker theorem for its speed. To do so, we design a renewal construction that withstands the long-range dependencies in the structure of the tree. This allows us to translate underlying ergodic properties of $mathcal{C}_{c}ir{c}^h$ into regularity estimates for the random walk.

This page was built for publication: Speed of the random walk on the supercritical Gaussian Free Field percolation on regular trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6433432)