Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion
Ronen Eldan, Dan Mikulincer, Prasad Raghavendra
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper1
相关 Paper
- Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequalityYeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson 等SODA 2023 · 被引用 6 次
- A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended AbstractShalev Ben-David, Eric BlaisFOCS 2020 · 被引用 9 次
- Concentration on the Boolean hypercube via pathwise stochastic analysisRonen Eldan, Renan GrossSTOC 2020 · 被引用 11 次
- Time-Space Lower Bounds for Bounded-Error Computation in the Random-Query ModelItai DinurSODA 2024 · 被引用 2 次
- Low-Degree Hardness of Random Optimization ProblemsDavid Gamarnik, Aukosh Jagannath, Alexander S. WeinFOCS 2020 · 被引用 48 次
