This workshop is being live streamed on our website. Full participation (including the capacity to ask questions) will be available via Zoom webinar. 

All talk times are in Pacific Time. 

Opening Remarks
Counting Solutions to Random CNF Formulas

Leslie Ann Goldberg, University of Oxford
Break
Break
Break
Incremental Approximate Message Passing

Ahmed El Alaoui, Stanford University
Social Hour
Introductions
Equitable Colorings

Afonso Bandeira, NYU
Break
Break
Break
Social Hour
Introductions
Break
Thresholds of Descending Algorithms in Inference Problems

Stefano Sarao Mannelli, IPhT CEA-Saclay
Break
Break
Break
Pedagogical Talk: Random Optimisation Problems

Amin Coja-Oghlan, Goethe University
Social Hour
Introductions
Break
Sampling From the Random Cluster Model at All Temperatures on Random Graphs

Will Perkins, University of Illinois at Chicago
Break
The Rank of Sparse Random Matrices

Jane Gao, University of Waterloo
Break
Social Hour
Introductions
Break
Break
Break
Social Hour