Concentration on the Boolean hypercube via pathwise stochastic analysis

Ronen Eldan, Renan Gross*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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 (Formula presented.) where hf(x) is the number of edges at x along which f changes its value, μ(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∑i=1nInfi(f)1+log(1/Infi(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.

Original languageEnglish
Pages (from-to)935-994
Number of pages60
JournalInventiones Mathematicae
Issue number3
StatePublished - Dec 2022
Externally publishedYes


  • Boolean analysis
  • Concentration
  • Isoperimetric inequality
  • Pathwise analysis


Dive into the research topics of 'Concentration on the Boolean hypercube via pathwise stochastic analysis'. Together they form a unique fingerprint.

Cite this