Majority is stablest: discrete and SoS
Theory of Computing, Volume 12, Issue 1, 2016, Pages 1-50.
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. The new p...More
PPT (Upload PPT)