Concentration on the Boolean hypercube via pathwise stochastic analysis

• 成果类型: Article
• 署名作者: Eldan, Ronen; Gross, Renan
• 署名单位: Weizmann Institute of Science
• 刊物名称: INVENTIONES MATHEMATICAE
• ISSN/ISSBN: 0020-9910
• DOI: 10.1007/s00222-022-01135-8
• 发表日期: 2022
• 页码: 935-994
• 关键词: noise sensitivity; thresholds; INEQUALITY; PROOF

摘要

We develop a new technique for proving concentration inequalities which relate the variance and influences of Boolean functions. Using this technique, we 1. Settle a conjecture of Talagrand (Combinatorica 17(2):275-285, 1997), proving that integral({-1,1}n) root h(f) (x)d mu(x) >= C . Var (f) . (log (1/Sigma Inf(i)(2)(f)))(1/2), where h(f) (x) is the number of edges at x along which f changes its value, mu(x) is the uniform measure on {-1, 1}(n), and Inf(i) (f) is the influence of the i-th coordinate. 2. Strengthen several classical inequalities concerning the influences of a Boolean function, showing that near-maximizers must have large vertex boundaries. An inequality due to Talagrand states that for a Boolean function f, Var (f) <= C Sigma(n)(i=1) Inf(i)(f)/1+log(1/Inf(i)(f)). We give a lower bound for the size of the vertex boundary of functions saturating this inequality. As a corollary, we show that for sets that satisfy the edge-isoperimetric inequality or the Kahn-Kalai-Linial inequality up to a constant, a constant proportion of the mass is in the inner vertex boundary. 3. Improve a quantitative relation between influences and noise stability given by Keller and Kindler. Our proofs rely on techniques based on stochastic calculus, and bypass the use of hypercontractivity common to previous proofs.