
The Extreme Tail
Huy Tuan Pham of the Institute for Advanced Study presents recent work on random graphs, delivered as part of the IAS Computer Science/Discrete Mathematics Seminar II. He frames the talk around a basic question: what is the probability that a random graph avoids a given structure, such as a triangle? While threshold theory describes the typical regime of this containment probability, Pham focuses on the extreme tail, the large deviations regime where precise asymptotics become the central problem. He presents joint work with Matthew Kwan establishing recent progress on these asymptotics and connects the results to broader ideas in modern combinatorics and probability theory. The talk is aimed at researchers with background in probabilistic combinatorics and moves through technical material at seminar pace, situating the new results against the established theory of random graph thresholds.