Three candidate plurality is stablest for small correlations
2021
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 maximise their noise stability must be being solved recently. Item (i) is also the first evidence for the optimality of the Frieze–Jerrum semidefinite program for solving MAX-3-CUT, assuming the unique games conjecture. Without the assumption that each candidate has an equal chance of winning in (i), the plurality is stablest conjecture is known to be false.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
30
References
0
Citations
NaN
KQI