Date
Tue, 07 Jun 2022
Time
16:30 - 17:30
Location
Virtual
Speaker
Jinyoung Park
Organisation
Stanford University

Thresholds for increasing properties of random structures are a central concern in probabilistic combinatorics and related areas. In 2006, Kahn and Kalai conjectured that for any nontrivial increasing property on a finite set, its threshold is never far from its "expectation-threshold," which is a natural (and often easy to calculate) lower bound on the threshold. In this talk, I will present recent progress on this topic. Based on joint work with Huy Tuan Pham.

Further Information

Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.

Please contact us with feedback and comments about this page. Last updated on 06 Jun 2022 12:42.