Robust optimality of Gaussian noise stability

From MaRDI portal
Publication:2019201



Abstract: We prove that under the Gaussian measure, half-spaces are uniquely the most noise stable sets. We also prove a quantitative version of uniqueness, showing that a set which is almost optimally noise stable must be close to a half-space. This extends a theorem of Borell, who proved the same result but without uniqueness, and it also answers a question of Ledoux, who asked whether it was possible to prove Borell's theorem using a direct semigroup argument. Our quantitative uniqueness result has various applications in diverse fields.


The famous Borell theorem says that half-spaces have optimal stability among all sets with a given Gaussian measure. In this paper, the authors give a novel proof for this result and its discrete applications and answer the question whether semigroup methods can be used to give a short and direct proof for the Borell inequality. They first demonstrate that half-spaces are the unique optimizers of Gaussian stability and then show that if the stability of a set is close to optimal given its measure, then the set must be close to a half-space. The authors derive from their Gaussian results some of the main discrete applications of Borell theorem, including a robust version of the ``majority is stablest theorem which in turn implies a robust version of the quantitative Arrow theorem in economics. The robust noise stability has specifically an application in the analysis of the well-known max-cut optimization problem. In this problem, one seeks a partition of a graph into two pieces such that the number of edges from one piece to the other is maximal.











This page was built for publication: Robust optimality of Gaussian noise stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019201)