相关论文: Three Candidate Plurality is Stablest for Small Co…

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…

We prove the three candidate Plurality is Stablest Conjecture of Khot-Kindler-Mossel-O'Donnell from 2005 for correlations $\rho$ satisfying $-1/43<\rho<1/10$: the Plurality function is the most noise stable three candidate election method…

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…

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…

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 $$…

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…

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…

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…

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…

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.…

Questions of noise stability play an important role in hardness of approximation in computer science as well as in the theory of voting. In many applications, the goal is to find an optimizer of noise stability among all possible partitions…

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…

We study the Gaussian noise stability of subsets A of Euclidean space satisfying A=-A. It is shown that an interval centered at the origin, or its complement, maximizes noise stability for small correlation, among symmetric subsets of the…

We verify that for all $n \geq 3$ and $2 \leq k \leq n+1$, the standard $k$-bubble clusters, conjectured to be minimizing total perimeter in $\mathbb{R}^n$, $\mathbb{S}^n$ and $\mathbb{H}^n$, are stable -- an infinitesimal regular…

We consider the coalition formation games with an additional component, `noisy preferences'. Moreover, such noisy preferences are available only for a sample of coalitions. We propose a multiplicative noise model and obtain the prediction…

It is shown that $m$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with minimum Gaussian surface area must be $(m-1)$-dimensional. This follows from a second variation argument using infinitesimal translations.…

Benjamini, Kalai and Schramm showed that a monotone function $f : \{-1,1\}^n \to \{-1,1\}$ is noise stable if and only if it is correlated with a half-space (a set of the form $\{x: \langle x, a\rangle \le b\}$). We study noise stability in…

Benjamini, Kalai and Schramm (2001) showed that weighted majority functions of $n$ independent unbiased bits are uniformly stable under noise: when each bit is flipped with probability $\epsilon$, the probability $p_\epsilon$ that the…

We exhibit a linear threshold function in 5 variables with strictly smaller noise stability (for small values of the correlation parameter) than the majority function on 5 variables, thereby providing a counterexample to the "Majority is…

The stable clustering hypothesis is a fundamental assumption about the nonlinear clustering of matter in cosmology. It states that the mean physical separation of particles is a constant on sufficiently small scales. While many authors have…