文章基本信息

标题：Majority is Stablest: Discrete and SoS
本地全文：下载
作者：Anindya De ; Elchanan Mossel ; Joe Neeman 等
期刊名称：Theory of Computing
印刷版ISSN：1557-2862
电子版ISSN：1557-2862
出版年度：2016
卷号：12
页码：1-50
出版社：University of Chicago
摘要：The “Majority is Stablest” Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the “Majority is Stablest” Theorem by induction on the dimension of the discrete cube. Unlike the previous proof, it uses neither the “invariance principle” nor Borell's result in Gaussian space. Moreover, the new proof allows us to derive a proof of “Majority is Stablest” in a constant level of the Sum of Squares hierarchy. This implies in particular that the Khot-Vishnoi instance of Max-Cut does not provide a gap instance for the Lasserre hierarchy
关键词：Majority is stablest; Sum-of-Squares hierarchy; Gaussian isoperimetry