Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion
Ronen Eldan, Dan Mikulincer, Prasad Raghavendra
Abstract
We consider a variant of the classical notion of noise on the Boolean hypercube which gives rise to a new approach to inequalities regarding noise stability. We use this approach to give a new proof of the Majority is Stablest theorem by Mossel, O'Donnell, and Oleszkiewicz, improving the dependence of the bound on the maximal influence of the function from logarithmic to polynomial. We also show that a variant of the conjecture by Courtade and Kumar regarding the most informative Boolean function, where the classical noise is replaced by our notion, holds true. Our approach is based on a stochastic construction that we call the renormalized Brownian motion, which facilitates the use of inequalities in Gaussian space in the analysis of Boolean functions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6b394752-7af6-4885-a216-4b81ec1837e6Cited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequalityYeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson et al.SODA 2023 · 6 citations
- A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended AbstractShalev Ben-David, Eric BlaisFOCS 2020 · 9 citations
- Concentration on the Boolean hypercube via pathwise stochastic analysisRonen Eldan, Renan GrossSTOC 2020 · 11 citations
- Time-Space Lower Bounds for Bounded-Error Computation in the Random-Query ModelItai DinurSODA 2024 · 2 citations
- Low-Degree Hardness of Random Optimization ProblemsDavid Gamarnik, Aukosh Jagannath, Alexander S. WeinFOCS 2020 · 48 citations
