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

–
Coffee & Check-In
–
Opening Remarks
–
The Complexity of Approximately Counting in 2-spin Systems on k-uniform Bounded-degree Hypergraphs
Leslie Ann Goldberg, University of Oxford
–
Dynamics for the Random-Cluster Model
Antonio Blanca, UC Berkeley
–
Break
–
Local Algorithms for Two Problems on Locally Tree-Like Graphs
Andrea Montanari, Stanford University
–
Lunch
–
Effect of Initial Conditions on Mixing for Spin Systems
Eyal Lubetzky, New York University
–
Cutoff on all Ramanujan Graphs
Yuval Peres, Microsoft Research Redmond
–
Reception
–
Coffee & Check-In
–
Counting Independent Sets in Hypergraphs when Strong Spatial Mixing Fails
Andreas Galanis, University of Oxford
–
Swendsen-Wang Algorithm on the Mean-Field Potts Model
Daniel Stefankovic, University of Rochester
–
Break
–
Random Walk on Random Directed Graphs
Justin Salez, Universite Paris Diderot
–
Lunch
–
Random Lattice Triangulations
Alexandre Stauffer, University of Bath
–
Glauber Dynamics of Lattice Triangulations on Thin Rectangles
Fabio Martinelli, Roma Tre University
–
Break
–
SAT Counting and Sampling -- From Theory to Practice
Moshe Vardi, Rice University
–
Coffee & Check-In
–
FPTAS for #BIS with Degree Bounds on One Side
Pinyan Lu (Shanghai University of Finance and Economics)
–
Curvature, Mixing, and Entropic Interpolation
James Lee, University of Washington
–
Break
–
Multi Diffusion Limited Aggregation
Vladas Sidoravicius, NYU-Shanghai and Courant Institute
–
Lunch
–
Free Afternoon for Discussion
–
Tea & Coffee
–
Open Problems Session
Prasad Tetali, Georgia Institute of Technology
–
Coffee & Check-In
–
Rates of Convergence for 'Features' of a Markov Chain
Persi Diaconis, Stanford University
–
Local Graph Coloring
Alexander Holroyd, Microsoft Research
–
Break
–
The Computational Complexity of Estimating Convergence Time
Nayantara Bhatnagar, University of Delaware
–
Lunch
–
Local Algorithms for Community Detection
Elchanan Mossel, UC Berkeley
–
Learning a Tree-Structured Ising Model in Order to Make Predictions
Guy Bresler, MIT
–
Break
–
Generating Random Permutations Using Switching Networks
Artur Czumaj, University of Warwick
–
Coffee & Check-In
–
Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics
Cris Moore, Santa Fe Institute
–
An Occupancy Approach to the Hard-Core Model
Will Perkins, University of Birmingham
–
Break
–
Equitable Rectangular Dissections of a Square
Dana Randall, Georgia Institute of Technology