- Series
- Job Candidate Talk
- Time
- Wednesday, December 15, 2021 - 11:00am for 1 hour (actually 50 minutes)
- Location
- https://bluejeans.com/487699041/8823
- Speaker
- Jinyoung Park – Stanford University – jinypark@stanford.edu – https://sites.google.com/view/jinyoungpark
- Organizer
- Xingxing Yu
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 first introduce the Kahn-Kalai Conjecture with some motivating examples and then talk about the recent resolution of a fractional version of the Kahn-Kalai Conjecture due to Frankston, Kahn, Narayanan, and myself. Some follow-up work, along with open questions, will also be discussed.