"When the mathematicians Jeff Kahn and Gil Kalai first posed their 'expectation threshold' conjecture in 2006, they didn’t believe it themselves. Their claim — a broad assertion about mathematical objects called random graphs — seemed too strong, too all-encompassing, too bold to possibly be true."
Past Member (2020–21) Jinyoung Park, a Szegö Assistant Professor at Stanford University, and Huy Tuan Pham, a Stanford Ph.D. student, proved the Kahn-Kalai Conjecture, a central problem in probabilistic combinatorics.
Three computer scientists, Nikhil Srivastava, former Visitor
in the School of Mathematics; Adam
Marcus, former von Neumann Fellow in the School; and Daniel
Spielman have solved a longstanding problem initially posed by
former Institute Members Richa...
