Isoperimetry and the Ornstein-Uhlenbeck Operator

Steve Heilman (NYU)

Abstract :

We first describe a generalization of the Gaussian isoperimetric problem to multiple sets, which was posed by Isaksson and Mossel. We then describe one of the motivations for this problem, the Plurality is Stablest problem. This problem looks for the voting method which is most stable to noise or corruption in the tabulation of the votes. Next, we briefly describe a proof of a very specific case of the conjecture of Isaksson and Mossel. If time permits, we will describe an application to the MAX-k-CUT problem from theoretical computer science.