• Click on the titles of individual talks for abstract, slides and archived video.

If you are tweeting about the workshop, please use the designated hashtag to enable other participants to follow the discussions online. The hashtag for this workshop is #SimonsRIPT.

Please note that this schedule is subject to change. All events take place in the Calvin Lab Auditorium.

–
Coffee & Check-In
–
Opening Remarks
–
Counting Solutions to Random Constraint Satisfaction Problems
Allan Sly, UC Berkeley
–
A Framework for Imperfectly Observed Networks
David Aldous (UC Berkeley)
–
Break
–
Phase Transitions in Random CSPs
Nike Sun, UC Berkeley
–
Lunch
–
Analysis of Algorithms on Dense Matrices using Approximate Message Passing
Andrea Montanari, Stanford University 
–
Recent Advances in Counting Sparse Graphs
Sourav Chatterjee, Stanford University
–
Break
–
Extremal Cuts of Sparse Random Graphs
Amir Dembo, Stanford University 
–
Reception
–
Coffee & Check-In
–
Average-Case Overcomplete Tensor Decomposition
David Steurer, Cornell University 
–
Phase Transitions in Low-Rank Matrix Estimation
Florent Krzakala, ENS
–
Break
–
Learning by Local Entropy Maximization
Riccardo Zecchina, Politecnico di Torino
–
Lunch
–
Teaching an Old Code a New Trick
Rüdiger Urbanke, EPFL
–
Information-Theoretic Bounds and Phase Transitions in Community Detection and High-Dimensional Clustering
Cris Moore, Santa Fe Institute 
–
Break
–
Spatial Coupling as a Proof Technique
Nicolas Macris, EPFL 
–
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model
Charilaos Efthymiou, Georgia Institute of Technology
–
Coffee & Check-In
–
Planted Clique, Sum-of-Squares and Pseudo-Calibration
Ankur Moitra, MIT
–
Community Detection with the Non-Backtracking Operator
Marc LeLarge, INRIA
–
Break
–
Phase Transitions in Semidefinite Relaxations (A Fast & Robust Algorithm for Community Detection)
Federico Ricci-Tersenghi, University of Rome La Sapienza
–
Lunch
–
Coffee & Check-In
–
Shotgun Assembly of Graphs
Elchanan Mossel, University of Pennsylvania 
–
Bootstrap Percolation on Random Graphs
Mihyun Kang, Technische Universität Graz, Austria
–
Break
–
Contagious Sets in Random Graphs
Daniel Reichman, UC Berkeley
–
Lunch
–
The Large Deviations of the Whitening Process in Random Constraint Satisfaction Problems
Guilhem Semerjian, Ecole Normale Supérieure
–
On the Chromatic Number of Random Regular Graphs
Samuel Hetterich, Goethe University Frankfurt
–
Break
–
The Lower Tail: Poisson Approximation Revisited
Lutz Warnke, University of Cambridge 
–
Coffee & Check-In
–
Stochastic Integration via Error-Correcting Codes
Dimitris Achlioptas, UC Santa Cruz
–
Solvable Model of Unsupervised Feature Learning
Lenka Zdeborova, CNRS and CEA Saclay
–
Break
–
Sum of Squares SDP Relaxations on Random Tensors
Prasad Raghavendra, UC Berkeley
–
Lunch