Uploaded October 2026 | Updated November 2026, 3 days ago
Ramon van Handel (Princeton University)
https://simons.berkeley.edu/talks/ramon-van-handel-princeton-university-2026-10-14
Probabilistic Phenomena on Graphs, Groups, and Manifolds
The spectral gap of a geometric structure — think of a graph, a manifold, a group — measures how quickly a random walker explores the entire structure. It is a problem of great interest, both in pure and in applied mathematics, to construct geometric structures with the largest possible spectral gap. In many cases, it is conjectured that optimal spectral gaps are ubiquitous, but this has been challenging to prove. Ramon van Handel will survey some remarkable progress that has been achieved in this area in the past two years and will describe a new approach, the polynomial method, that has made it possible to establish optimal spectral gaps in various new situations. (Based in part on joint works with C.-F. Chen, J. Garza-Vargas, M. Magee, D. Puder, and J. Tropp.)
Ramon van Handel is a Professor of Mathematics at Princeton University. He received his PhD in 2007 from Caltech. His research interests lie broadly in probability theory, analysis, geometry, and their interactions. His honors include the NSF Career and PECASE awards, the Erlang Prize, an ICBS Frontiers of Science Award, the Princeton University Graduate Mentoring Award, and several teaching awards. He was an invited speaker at the 2026 ICM, and is currently serving as co-Editor-in-Chief of the journal Probability Theory and Related Fields.
Ramon van Handel (Princeton University)
https://simons.berkeley.edu/talks/ramon-van-handel-princeton-university-2026-10-14
Probabilistic Phenomena on Graphs, Groups, and Manifolds
The spectral gap of a geometric structure — think of a graph, a manifold, a group — measures how quickly a random walker explores the entire structure. It is a problem of great interest, both in pure and in applied mathematics, to construct geometric structures with the largest possible spectral gap. In many cases, it is conjectured that optimal spectral gaps are ubiquitous, but this has been challenging to prove. Ramon van Handel will survey some remarkable progress that has been achieved in this area in the past two years and will describe a new approach, the polynomial method, that has made it possible to establish optimal spectral gaps in various new situations. (Based in part on joint works with C.-F. Chen, J. Garza-Vargas, M. Magee, D. Puder, and J. Tropp.)
Ramon van Handel is a Professor of Mathematics at Princeton University. He received his PhD in 2007 from Caltech. His research interests lie broadly in probability theory, analysis, geometry, and their interactions. His honors include the NSF Career and PECASE awards, the Erlang Prize, an ICBS Frontiers of Science Award, the Princeton University Graduate Mentoring Award, and several teaching awards. He was an invited speaker at the 2026 ICM, and is currently serving as co-Editor-in-Chief of the journal Probability Theory and Related Fields.









![In Search of Missing Mass: Disentangling Discoveries from Hallucinations
Eric Nalisnick (Johns Hopkins University)
https://simons.berkeley.edu/talks/eric-nalisnick-johns-hopkins-university-2026-10-07
Trustworthy AI: From Hallucinations to Reliable Autonomy
Large language models (LLMs) hold much promise for scientific discovery. However, many basic questions remain about when an LLM can reliably make discoveries. In this talk, I will discuss how to interpret and extend the hallucination results of Kalai & Vempala [STOC 2024] to characterize an LLMs potential for discovery. In particular, how might we identify prompts that are likely to yield discoveries rather than hallucinations? In Search of Missing Mass: Disentangling Discoveries from Hallucinations](https://i.ytimg.com/vi/ZNlZsI9kBm4/mqdefault.jpg)
