STRONG NOISE SENSITIVITY AND RANDOM GRAPHS
成果类型：
Article
署名作者：
Lubetzky, Eyal; Steif, Jeffrey E.
署名单位：
Chalmers University of Technology; University of Gothenburg
刊物名称：
ANNALS OF PROBABILITY
ISSN/ISSBN：
0091-1798
DOI：
10.1214/14-AOP959
发表日期：
2015
页码：
3239-3278
关键词：
摘要：
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 Etudes 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 Erdos-Renyi 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) -> 0 polynomially fast in the number of variables.