Percolation for level-sets of Gaussian free fields on metric graphs

From MaRDI portal
Publication:784175

DOI10.1214/19-AOP1397zbMATH Open1505.60087arXiv1807.11117MaRDI QIDQ784175FDOQ784175

Mateo Wirth, Jian Ding

Publication date: 31 July 2020

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: We study level-set percolation for Gaussian free fields on metric graphs. In two dimensions, we give an upper bound on the chemical distance between the two boundaries of a macroscopic annulus. Our bound holds with high probability conditioned on connectivity and the bound is sharp up to a poly-logarithmic factor with an exponent of one-quarter. This substantially improves a previous result by Li and the first author. In three dimensions and higher, we provide rather sharp estimates of percolation probabilities in different regimes which altogether describe a sharp phase transition.


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





Cites Work


Cited In (15)






This page was built for publication: Percolation for level-sets of Gaussian free fields on metric graphs

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