Generated by GPT-5-mini| Emanuel Mossel | |
|---|---|
| Name | Emanuel Mossel |
| Birth date | 1968 |
| Birth place | Cologne, Germany |
| Nationality | German |
| Fields | Mathematics, Probability Theory, Combinatorics, Game Theory |
| Workplaces | University of Bonn, Hebrew University of Jerusalem, ETH Zurich |
| Alma mater | University of Bonn |
| Doctoral advisor | Manfred Denker |
| Known for | Influence in probabilistic combinatorics, noise stability, social choice theory |
Emanuel Mossel
Emanuel Mossel is a German-born mathematician known for contributions to probability theory, combinatorics, and applications to computer science and social choice theory. His work spans analytical techniques for stochastic processes, structural results in high-dimensional probability, and rigorous analysis of voting and aggregation models. Mossel has held faculty positions at several leading institutions and collaborated widely across disciplines, influencing research at the intersection of mathematical statistics, theoretical computer science, and economics.
Mossel was born in Cologne and completed his undergraduate and graduate studies at the University of Bonn, where he earned a doctorate under the supervision of Manfred Denker. During his formative years he engaged with research groups linked to probability theory and ergodic theory, interacting with scholars affiliated with the Max Planck Institute for Mathematics and the Hausdorff Center for Mathematics. His doctoral work situated him within a network that included contacts at the Institute for Advanced Study and collaborations that later connected him to researchers at the Weizmann Institute of Science.
After receiving his doctorate Mossel held postdoctoral and faculty appointments that included positions at the Hebrew University of Jerusalem, the Massachusetts Institute of Technology, and the University of California, Berkeley before joining the faculty at the University of Pennsylvania and later the University of British Columbia and Yale University; he subsequently returned to Europe with appointments at ETH Zurich and the Institute for Advanced Study. He has supervised doctoral students who went on to posts at the University of Cambridge, Princeton University, Google Research, and national research institutes such as the National Institute of Standards and Technology and the French National Centre for Scientific Research. Mossel has organized workshops and programs at the Simons Institute for the Theory of Computing, the Banff International Research Station, and the Institut Henri Poincaré.
Mossel's research includes foundational results on noise sensitivity and stability of Boolean functions, rigorous proofs concerning influence bounds, and invariance principles linking discrete and Gaussian models. He is coauthor of influential theorems connecting discrete isoperimetric phenomena to Gaussian isoperimetry, building on work by Borell and Bobkov and extending techniques from Talagrand and Kahn, Kalai, and Linial. His collaborative proof of an invariance principle provided tools used in hardness of approximation results central to computational complexity theory and the study of probabilistic models in statistical physics.
Specific contributions include analyses of the Majority is Stablest conjecture, results on social choice paradoxes, and quantitative central limit theorems for multilinear polynomials of independent random variables. These results impacted approaches to the Unique Games Conjecture and approximation algorithms for problems such as Max-Cut and influenced probabilistic techniques used in the study of random graphs and percolation phenomena like those examined around the Erdős–Rényi model and bootstrap percolation. Mossel's work on aggregation of information and noise stability found applications in the theory of voting equilibria connected to scholars at the Center for the Study of Rationality and interactions with research on mechanism design at the Cowles Foundation.
Mossel has also applied probabilistic coupling techniques to study random processes on networks, linking to work on mixing times and spectral graph theory associated with the Perron–Frobenius theorem and results by Lovász and Chung. His multidisciplinary collaborations span researchers from machine learning groups at Carnegie Mellon University and Stanford University to economists at the University of Chicago and political scientists studying collective decision-making.
Mossel's contributions have been recognized with invitations to speak at major international conferences including the International Congress of Mathematicians and specialized meetings at the Conference on Learning Theory and the Symposium on Theory of Computing. He has received research fellowships from organizations such as the Simons Foundation and national research agencies in Germany and Israel, and held visiting appointments at the Institut des Hautes Études Scientifiques and the Mathematical Sciences Research Institute. His students and collaborators have been recipients of early-career prizes from the American Mathematical Society and the Association for Computing Machinery.
Mossel maintains active engagement with the broader scientific community through editorial service for journals in probability theory and theoretical computer science, and by organizing interdisciplinary seminars bridging statistics and economics. He has participated in outreach lectures at venues like public events hosted by the Royal Institution and national science festivals in Germany and Israel, and contributed expository articles for publications associated with the European Mathematical Society and the American Association for the Advancement of Science. Outside academia he is known to support initiatives aimed at increasing participation in mathematics at secondary schools and has collaborated with non-profit organizations promoting STEM education in urban centers.
Category:Living people Category:German mathematicians Category:Probability theorists Category:University of Bonn alumni