# Elchanan Mossel

## Research

*Probability, Algorithms and Inference *

## Bio

Elchanan Mossel 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, to sharp results in the analysis of Gibbs samplers from statistical physics, and the optimal results in inference problems for block models and planted partitions. His research has resolved open problems in computational biology, machine learning, social choice theory, and economics.

Mossel received his 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. He joined the University of California at Berkeley faculty in 2003, where he was a professor of statistics and computer science. He spent leaves as a professor at the Weizmann Institute (2008-2010) and at the Wharton School, University of Pennsylvania (2014-2016).

Mosselâ€™s distinctions include the Sloan Research Fellowship (2005), the NSF CAREER Award (2006), and the Bergmann Memorial Award, the U.S.-Israel Binational Science Foundation (2007).

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 (ACM) "for contributions to theoretical computer science and inference"

Mossel gave a Special Sectional Lecture at the International Congress of Mathematics 2022, titled "Combinatorial Statistics and the Sciences" (in sections 12 probability, 13 combinatorics, 14 mathematics of computer science and 18 stochastic and differential modeling).

In 2024, he was elected as a member of the US National Academy of Arts and Sciences.