## The Annals of Probability

### Strong noise sensitivity and random graphs

#### Abstract

The noise sensitivity of a Boolean function describes its likelihood to flip under small perturbations of its input. Introduced in the seminal work of Benjamini, Kalai and Schramm [Inst. Hautes Études Sci. Publ. Math. 90 (1999) 5–43], it was there shown to be governed by the first level of Fourier coefficients in the central case of monotone functions at a constant critical probability $p_{c}$.

Here we study noise sensitivity and a natural stronger version of it, addressing the effect of noise given a specific witness in the original input. Our main context is the Erdős–Rényi random graph, where already the property of containing a given graph is sufficiently rich to separate these notions. In particular, our analysis implies (strong) noise sensitivity in settings where the BKS criterion involving the first Fourier level does not apply, for example, when $p_{c}\to0$ polynomially fast in the number of variables.

#### Article information

Source
Ann. Probab., Volume 43, Number 6 (2015), 3239-3278.

Dates
Revised: May 2014
First available in Project Euclid: 11 December 2015

https://projecteuclid.org/euclid.aop/1449843630

Digital Object Identifier
doi:10.1214/14-AOP959

Mathematical Reviews number (MathSciNet)
MR3433581

Zentralblatt MATH identifier
1339.82005

#### Citation

Lubetzky, Eyal; Steif, Jeffrey E. Strong noise sensitivity and random graphs. Ann. Probab. 43 (2015), no. 6, 3239--3278. doi:10.1214/14-AOP959. https://projecteuclid.org/euclid.aop/1449843630

#### References

• [1] Alon, N. and Spencer, J. H. (2008). The Probabilistic Method, 3rd ed. Wiley, Hoboken, NJ. With an appendix on the life and work of Paul Erdős.
• [2] Arratia, R., Goldstein, L. and Gordon, L. (1989). Two moments suffice for Poisson approximations: The Chen–Stein method. Ann. Probab. 17 9–25.
• [3] Ben-Or, M. and Linial, N. (1990). Collective coin flipping. In Randomness and Computation (S. Micali, ed.) 91–115. Academic Press, San Diego. Earlier version in FOCS 1985.
• [4] Benjamini, I., Haber, S., Krivelevich, M. and Lubetzky, E. (2008). The isoperimetric constant of the random graph process. Random Structures Algorithms 32 101–114.
• [5] Benjamini, I., Kalai, G. and Schramm, O. (1999). Noise sensitivity of Boolean functions and applications to percolation. Inst. Hautes Études Sci. Publ. Math. 90 5–43 (2001).
• [6] Bollobás, B. (2001). Random Graphs, 2nd ed. Cambridge Studies in Advanced Mathematics 73. Cambridge Univ. Press, Cambridge.
• [7] Friedgut, E. (1999). Sharp thresholds of graph properties, and the $k$-sat problem. J. Amer. Math. Soc. 12 1017–1054. With an appendix by Jean Bourgain.
• [8] Garban, C. and Steif, J. E. (2012). Noise sensitivity and percolation. In Probability and Statistical Physics in Two and More Dimensions (D. Ellwood, C. Newman, V. Sidoravicius and W. Werner, eds.). Clay Math. Proc. 15 49–154. Amer. Math. Soc., Providence, RI.
• [9] Janson, S., Łuczak, T. and Rucinski, A. (2000). Random Graphs. Wiley, New York.
• [10] Kahn, J., Kalai, G. and Linial, N. (1988). The influence of variables on Boolean functions. In Proc. of the 29th IEEE Symp. on Foundations of Computer Science (FOCS 1988) 68–80. IEEE, White Plains, NY.
• [11] Keller, N. and Kindler, G. (2013). Quantitative relation between noise sensitivity and influences. Combinatorica 33 45–71.
• [12] Lyons, R. and Peres, Y. (2013). Probability on trees and networks. Cambridge Univ. Press. In preparation, available at http://mypage.iu.edu/~rdlyons/prbtree/book.pdf.
• [13] Pakes, A. G. and Dekking, F. M. (1991). On family trees and subtrees of simple branching processes. J. Theoret. Probab. 4 353–369.
• [14] Riordan, O. and Wormald, N. (2010). The diameter of sparse random graphs. Combin. Probab. Comput. 19 835–926.
• [15] Schramm, O. and Steif, J. E. (2010). Quantitative noise sensitivity and exceptional times for percolation. Ann. of Math. (2) 171 619–672.