<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body dir="auto"><div dir="ltr"><meta http-equiv="content-type" content="text/html; charset=utf-8"><span style="-webkit-text-size-adjust: auto;">Departments of Mathematics & Computer Science</span><br style="-webkit-text-size-adjust: auto;"><span style="-webkit-text-size-adjust: auto;">Combinatorics & Theory Seminar</span><br style="-webkit-text-size-adjust: auto;"><span style="-webkit-text-size-adjust: auto;"></span><br style="-webkit-text-size-adjust: auto;"><span style="-webkit-text-size-adjust: auto;">Tuesday, November 8, 3:30pm</span><br style="-webkit-text-size-adjust: auto;"><span style="-webkit-text-size-adjust: auto;">Location Kent 107<b> </b></span></div><div dir="ltr"><br></div><div dir="ltr">SPEAKER: Huy Tuan Pham (Stanford)</div><div dir="ltr"><br><span style="-webkit-text-size-adjust: auto;">TITLE: </span>Talagrand’s selector process conjecture and suprema of positive empirical processes<span style="-webkit-text-size-adjust: auto;"> </span></div><div dir="ltr"><span style="-webkit-text-size-adjust: auto;"></span><br style="-webkit-text-size-adjust: auto;"><span style="-webkit-text-size-adjust: auto;">ABSTRACT:<font face="Arial, sans-serif"><span style="white-space: pre-wrap;"> </span></font></span>Understanding suprema of stochastic processes is an important subject in probability theory with many applications. While much is known in the case of Gaussian processes thanks to Talagrand’s celebrated majorizing measure theorem, moving beyond the Gaussian case is a much more challenging quest. In this talk, I will discuss recent joint work with Jinyoung Park that resolves a conjecture of Talagrand on extreme events of suprema of certain stochastic processes driven by sparse Bernoulli random variables (known as selector processes), and a question of Talagrand on general positive empirical processes. Combining with the recent resolution of the (generalized) Bernoulli conjecture, this gives the first steps towards the last missing piece in the study of suprema of general empirical processes.
The proof of Talagrand’s conjecture is combinatorial and easily leads to the proof of the Kahn-Kalai conjecture, an important question in probabilistic combinatorics and random graph theory. <div style="-webkit-text-size-adjust: auto; font-family: Arial, sans-serif; white-space: pre-wrap;"><p><u></u></p></div><div style="-webkit-text-size-adjust: auto; font-family: Arial, sans-serif; white-space: pre-wrap;"><p><br></p></div><div dir="ltr"></div></div></body></html>