Quantitative noise sensitivity and exceptional times for percolation

From MaRDI portal
Publication:974053

DOI10.4007/ANNALS.2010.171.619zbMATH Open1213.60160arXivmath/0504586OpenAlexW2078345182WikidataQ29035751 ScholiaQ29035751MaRDI QIDQ974053FDOQ974053

Jeffrey E. Steif, Oded Schramm

Publication date: 27 May 2010

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Abstract: One goal of this paper is to prove that dynamical critical site percolation on the planar triangular lattice has exceptional times at which percolation occurs. In doing so, new quantitative noise sensitivity results for percolation are obtained. The latter is based on a novel method for controlling the "level k" Fourier coefficients via the construction of a randomized algorithm which looks at random bits, outputs the value of a particular function but looks at any fixed input bit with low probability. We also obtain upper and lower bounds on the Hausdorff dimension of the set of percolating times. We then study the problem of exceptional times for certain "k-arm" events on wedges and cones. As a corollary of this analysis, we prove, among other things, that there are no times at which there are two infinite "white" clusters, obtain an upper bound on the Hausdorff dimension of the set of times at which there are both an infinite white cluster and an infinite black cluster and prove that for dynamical critical bond percolation on the square grid there are no exceptional times at which three disjoint infinite clusters are present.


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




Recommendations




Cites Work


Cited In (57)





This page was built for publication: Quantitative noise sensitivity and exceptional times for percolation

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