Maximally stable Gaussian partitions with discrete applications
From MaRDI portal
Publication:1760364
DOI10.1007/s11856-011-0181-7zbMath1256.60017arXiv0903.3362MaRDI QIDQ1760364
Marcus Isaksson, Elchanan Mossel
Publication date: 13 November 2012
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.3362
60G15: Gaussian processes
91B12: Voting theory
91B14: Social choice
60G09: Exchangeability for stochastic processes
Related Items
Dimension Reduction for Polynomials over Gaussian Space and Applications, Remarks on Gaussian Noise Stability, Brascamp-Lieb and Slepian Inequalities, Unnamed Item, Standard simplices and pluralities are not the most noise stable, A two-sided estimate for the Gaussian noise stability deficit, Robust optimality of Gaussian noise stability, Gaussian bounds for noise correlation of resilient functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Noise stability of functions with low influences: invariance and optimality
- Proof of the double bubble conjecture
- Sharp inequalities for functional integrals and traces of conformally invariant operators.
- A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem.
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
- Gaussian bounds for noise correlation of functions
- On the hardness of approximating Multicut and Sparsest-Cut
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Conditional hardness for approximate coloring
- Towards Sharp Inapproximability for Any 2-CSP
- Geometric bounds on the Ornstein-Uhlenbeck velocity process
- On the power of unique 2-prover 1-round games
- Limit Theorems for Multilinear Forms and Quasipolynomial Functions
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Coin flipping from a cosmic source: On error correction of truly random bits
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Social Indeterminacy
- Comparison theorems for exit times
