Bargmann-Fock percolation is noise sensitive

From MaRDI portal
(Redirected from Publication:2201513)




Abstract: We show that planar Bargmann-Fock percolation is noise sensitive under the Ornstein-Ulhenbeck process. The proof is based on the randomized algorithm approach introduced by Schramm and Steif and gives quantitative polynomial bounds on the noise sensitivity of crossing events for Bargmann-Fock. A rather counter-intuitive consequence is as follows. Let F be a Bargmann-Fock Gaussian field in mathbbR3 and consider two horizontal planes P1,P2 at small distance varepsilon from each other. Even though F is a.s. analytic, the above noise sensitivity statement implies that the full restriction of F to P1 (i.e. F|P1) gives almost no information on the percolation configuration induced by F|P2. As an application of this noise sensitivity analysis, we provide a Schramm-Steif based proof that the near-critical window of level line percolation around ellc=0 is polynomially small. This new approach extends earlier sharp threshold results to a larger family of planar Gaussian fields.









This page was built for publication: Bargmann-Fock percolation is noise sensitive

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