Quantitative noise sensitivity and exceptional times for percolation
DOI10.4007/annals.2010.171.619zbMath1213.60160arXivmath/0504586OpenAlexW2078345182WikidataQ29035751 ScholiaQ29035751MaRDI QIDQ974053
Jeffrey E. Steif, Oded Schramm
Publication date: 27 May 2010
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0504586
Hausdorff dimensionrandomized algorithmFourier coefficientsnoise sensitivitytime-dependent percolation
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Complexity of computation (including implicit computational complexity) (03D15) Fourier series and coefficients in several variables (42B05) Time-dependent percolation in statistical mechanics (82C43)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-dimensional critical percolation: the full scaling limit
- On the potential theory of symmetric Markov processes
- Exceptional planes of percolation
- Almost all words are seen in critical site percolation on the triangular lattice
- Dynamic Boolean models
- Dynamical percolation
- The number of infinite clusters in dynamical percolation
- Scaling limits of loop-erased random walks and uniform spanning trees
- Critical exponents for two-dimensional percolation
- Scaling relations for 2D-percolation
- Local properties of Lévy processes on a totally disconnected group
- Strict inequalities for some critical exponents in two-dimensional percolation
- One-arm exponent for critical 2D percolation
- Concentration of measure and isoperimetric inequalities in product spaces
- Dynamical stability of percolation for some interacting particle systems and \(\varepsilon\)-movability
- Critical percolation in the plane: conformal invariance, Cardy's formula, scaling limits
- Naturality, standardness, and weak duality for Markov processes
- Random-Turn Hex and Other Selection Games
- Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read
- Percolation
- Proof of the Van den Berg–Kesten Conjecture
- Noise sensitivity of Boolean functions and applications to percolation