Jan 17 – Bhargav Narayanan: Thresholds
When does a random graph contain a perfect matching? Or a Hamilton cycle? The answers to such problems, referred to as "thresholds", have been the central concern of the study of random discrete structures. A general guess for the location of the threshold for any