Elchanan Mossel
Elchanan Mossel, professor of mathematics at MIT, works in probability, combinatorics and inference. His interests include combinatorical statistics, discrete Fourier analysis, randomized algorithms, computational complexity, Markov random fields, social choice, game theory, evolution, and the mathematical foundations of deep learning.
His research in discrete function inequalities, isoperimetry, and hypercontractiviting led to the proof that Majority is Stablest and confirmed that optimality of the Goemans-Williamson MAX-CUT algorithm under the unique games conjecture from computational complexity. His work on the reconstruction problem on trees provides optimal algorithms and bounds for phylogenetic reconstruction in molecular biology and has led to sharp results in the analysis of Gibbs samplers from statistical physics and inference problems on graphs. His research has resolved open problems in computational biology, machine learning, social choice theory, and economics.
Mossel joined the faculty of the MIT Mathematics Department as a full professor in July 2016, with a joint appointment at the Statistics and Data Science Center of the MIT Institute for Data, Systems and Society. In 2019, Mossel was named a Simons Investigator in Mathematics. He was also selected to be a Fellow of the AMS. In 2020, he received the Vannevar Bush Faculty Fellowship of the Department of Defense. In 2021 Mossel was elected as Fellow of the Association for Computing Machinery.
Mossel received the BSc from the Open University in Israel in 1992. He received both the MSc (1997) and PhD (2000) degrees in mathematics from the Hebrew University of Jerusalem. He was a postdoctoral fellow at the Microsoft Research Theory Group and a Miller Fellow at University of California at Berkeley.