English
Related papers

Related papers: Three Candidate Plurality is Stablest for Correlat…

200 papers

Using the calculus of variations, we prove the following structure theorem for noise stable partitions: a partition of $n$-dimensional Euclidean space into $m$ disjoint sets of fixed Gaussian volumes that maximize their noise stability must…

Probability · Mathematics 2023-06-22 Steven Heilman , Alex Tarter

We conjecture that Borda count is the ranked choice voting method that best preserves the outcome of an election with randomly corrupted votes, among all fair voting methods with small influences satisfying the Condorcet Loser Criterion.…

Computer Science and Game Theory · Computer Science 2022-09-23 Steven Heilman

Gaussian noise stability results have recently played an important role in proving results in hardness of approximation in computer science and in the study of voting schemes in social choice. We prove a new Gaussian noise stability result…

Probability · Mathematics 2009-08-03 Marcus Isaksson , Elchanan Mossel

The Standard Simplex Conjecture and the Plurality is Stablest Conjecture are two conjectures stating that certain partitions are optimal with respect to Gaussian and discrete noise stability respectively. These two conjectures are natural…

Probability · Mathematics 2014-07-10 Steven Heilman , Elchanan Mossel , Joe Neeman

The noise stability of a Euclidean set $A$ with correlation $\rho$ is the probability that $(X,Y)\in A\times A$, where $X,Y$ are standard Gaussian random vectors with correlation $\rho\in(0,1)$. It is well-known that a Euclidean set of…

Probability · Mathematics 2022-09-23 Steven Heilman

It is shown that $3$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with nearly minimum total Gaussian surface area must be close to adjacent $120$ degree sectors, when $n\geq2$. These same results hold for any…

Probability · Mathematics 2019-01-15 Steven Heilman

The Standard Simplex Conjecture of Isaksson and Mossel asks for the partition $\{A_{i}\}_{i=1}^{k}$ of $\mathbb{R}^{n}$ into $k\leq n+1$ pieces of equal Gaussian measure of optimal noise stability. That is, for $\rho>0$, we maximize $$…

Computational Complexity · Computer Science 2014-05-27 Steven Heilman

We prove a vector-valued inequality for the Gaussian noise stability (i.e. we prove a vector-valued Borell inequality) for Euclidean functions taking values in the two-dimensional sphere, for all correlation parameters at most $1/10$ in…

Quantum Physics · Physics 2023-09-04 Steven Heilman

We survey the design of elections that are resilient to attempted interference by third parties. For example, suppose votes have been cast in an election between two candidates, and then each vote is randomly changed with a small…

Probability · Mathematics 2021-07-13 Steven Heilman

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…

Computational Complexity · Computer Science 2012-11-07 Anindya De , Elchanan Mossel , Joe Neeman

We study two conjectures posed in the analysis of Boolean functions $f : \{-1, 1\}^n \to \{-1, 1\}$, in both of which, the Majority function plays a central role: the "Majority is Least Stable" (Benjamini et al., 1999) and the…

Computational Complexity · Computer Science 2026-04-09 Pritish Kamath , Ravi Kumar , Pasin Manurangsi

The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. In \cite{McL11}, McLennan showed that a similar impossibility result holds even if we consider…

Computer Science and Game Theory · Computer Science 2015-04-13 Samantha Leung , Edward Lui , Rafael Pass

We establish the Gaussian Multi-Bubble Conjecture: the least Gaussian-weighted perimeter way to decompose $\mathbb{R}^n$ into $q$ cells of prescribed (positive) Gaussian measure when $2 \leq q \leq n+1$, is to use a "simplicial cluster",…

Differential Geometry · Mathematics 2021-12-02 Emanuel Milman , Joe Neeman

The results of Raghavendra (2008) show that assuming Khot's Unique Games Conjecture (2002), for every constraint satisfaction problem there exists a generic semi-definite program that achieves the optimal approximation factor. This result…

Computational Complexity · Computer Science 2013-08-12 Anindya De , Elchanan Mossel

Using the calculus of variations, we prove that a Euclidean set of fixed Gaussian measure that nearly maximizes Gaussian noise stability is close to a half space. The main result proves a modification of a conjecture of Eldan from 2013: a…

Probability · Mathematics 2021-08-12 Steven Heilman

The metric distortion framework posits that n voters and m candidates are jointly embedded in a metric space such that voters rank candidates that are closer to them higher. A voting rule's purpose is to pick a candidate with minimum total…

Computer Science and Game Theory · Computer Science 2023-07-03 Fatih Erdem Kizilkaya , David Kempe

In 1976, Knuth asked if the stable marriage problem (SMP) can be generalized to marriages consisting of 3 genders. In 1988, Alkan showed that the natural generalization of SMP to 3 genders ($3$GSM) need not admit a stable marriage. Three…

Computational Complexity · Computer Science 2014-12-04 Rafail Ostrovsky , Will Rosenbaum

The Gaussian noise stability of a function $f:\mathbb{R}^n \to \{-1, 1\}$ is the expected value of $f(\boldsymbol{x}) \cdot f(\boldsymbol{y})$ over $\rho$-correlated Gaussian random variables $\boldsymbol{x}$ and $\boldsymbol{y}$. Borell's…

Quantum Physics · Physics 2022-09-30 Yeongwoo Hwang , Joe Neeman , Ojas Parekh , Kevin Thompson , John Wright

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…

Probability · Mathematics 2013-02-25 Elchanan Mossel , Joe Neeman

We revisit the noisy binary search model of Karp and Kleinberg, in which we have $n$ coins with unknown probabilities $p_i$ that we can flip. The coins are sorted by increasing $p_i$, and we would like to find where the probability crosses…

Data Structures and Algorithms · Computer Science 2023-11-03 Lucas Gretta , Eric Price
‹ Prev 1 2 3 10 Next ›