Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees

From MaRDI portal
Publication:782808

DOI10.1214/20-EJP468zbMATH Open1446.60079arXiv1909.01973OpenAlexW3036201095MaRDI QIDQ782808FDOQ782808


Authors: Angelo Abächerli, Jiří Černý Edit this on Wikidata


Publication date: 29 July 2020

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: We study level-set percolation of the Gaussian free field on the infinite d-regular tree for fixed dgeq3. Denoting by hstar the critical value, we obtain the following results: for h>hstar we derive estimates on conditional exponential moments of the size of a fixed connected component of the level set above level h; for h<hstar we prove that the number of vertices connected over distance k above level h to a fixed vertex grows exponentially in k with positive probability. Furthermore, we show that the percolation probability is a continuous function of the level h, at least away from the critical value hstar. Along the way we also obtain matching upper and lower bounds on the eigenfunctions involved in the spectral characterisation of the critical value hstar and link the probability of a non-vanishing limit of the martingale used therein to the percolation probability. A number of the results derived here are applied in the accompanying paper [AC2].


Full work available at URL: https://arxiv.org/abs/1909.01973




Recommendations




Cites Work


Cited In (16)





This page was built for publication: Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees

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