Concentration on the Boolean hypercube via pathwise stochastic analysis
Ronen Eldan, Renan Gross

TL;DR
This paper introduces a novel stochastic calculus-based method to prove concentration inequalities for Boolean functions, settling a longstanding conjecture and strengthening classical influence inequalities.
Contribution
Develops a new stochastic analysis technique to prove concentration inequalities, settling Talagrand's conjecture and strengthening influence-related inequalities in Boolean functions.
Findings
Proved Talagrand's conjecture on the relationship between variance and influences.
Strengthened classical influence inequalities, showing near-maximizers have large vertex boundaries.
Improved the quantitative relation between influences and noise stability.
Abstract
We develop a new technique for proving concentration inequalities which relate between the variance and influences of Boolean functions. Using this technique, we 1. Settle a conjecture of Talagrand [Tal97] proving that where is the number of edges at along which changes its value, and is the influence of the -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 , $\mathrm{var}\left(f\right)\leq…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbabilistic and Robust Engineering Design · Statistical Methods and Inference · Markov Chains and Monte Carlo Methods
