Workshops

Spring 2016

Approximate Counting, Markov Chains and Phase Transitions

Feb 22, 2016 to Feb 26, 2016

Return to event »

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

Monday, February 22nd, 2016
9:00 am–9:20 am		Coffee & Check-In
9:20 am–9:30 am		Opening Remarks
9:30 am–10:15 am		The Complexity of Approximately Counting in 2-spin Systems on k-uniform Bounded-degree Hypergraphs Leslie Ann Goldberg, University of Oxford
10:25 am–11:10 am		Dynamics for the Random-Cluster Model Antonio Blanca, UC Berkeley
11:10 am–11:40 am		Break
11:40 am–12:25 pm		Local Algorithms for Two Problems on Locally Tree-Like Graphs Andrea Montanari, Stanford University
12:25 pm–2:00 pm		Lunch
2:00 pm–2:45 pm		Effect of Initial Conditions on Mixing for Spin Systems Eyal Lubetzky, New York University
2:55 pm–3:40 pm		Cutoff on all Ramanujan Graphs Yuval Peres, Microsoft Research Redmond
3:40 pm–5:00 pm		Reception

Tuesday, February 23rd, 2016
9:00 am–9:30 am		Coffee & Check-In
9:30 am–10:15 am		Counting Independent Sets in Hypergraphs when Strong Spatial Mixing Fails Andreas Galanis, University of Oxford
10:25 am–11:10 am		Swendsen-Wang Algorithm on the Mean-Field Potts Model Daniel Stefankovic, University of Rochester
11:10 am–11:40 am		Break
11:40 am–12:25 pm		Random Walk on Random Directed Graphs Justin Salez, Universite Paris Diderot
12:25 pm–2:00 pm		Lunch
2:00 pm–2:45 pm		Random Lattice Triangulations Alexandre Stauffer, University of Bath
2:55 pm–3:40 pm		Glauber Dynamics of Lattice Triangulations on Thin Rectangles Fabio Martinelli, Roma Tre University
3:40 pm–4:10 pm		Break
4:10 pm–4:55 pm		SAT Counting and Sampling -- From Theory to Practice Moshe Vardi, Rice University

Wednesday, February 24th, 2016
9:00 am–9:30 am		Coffee & Check-In
9:30 am–10:15 am		FPTAS for #BIS with Degree Bounds on One Side Pinyan Lu, Shanghai University of Finance and Economics
10:25 am–11:10 am		Curvature, Mixing, and Entropic Interpolation James Lee, University of Washington
11:10 am–11:40 am		Break
11:40 am–12:25 pm		Multi Diffusion Limited Aggregation Vladas Sidoravicius, NYU-Shanghai and Courant Institute
12:25 pm–2:00 pm		Lunch
2:00 pm–3:40 pm		Free Afternoon for Discussion
3:40 pm–4:10 pm		Tea & Coffee
4:10 pm–5:00 pm		Open Problems Session Moderator: Prasad Tetali, Georgia Institute of Technology

Thursday, February 25th, 2016
9:00 am–9:30 am		Coffee & Check-In
9:30 am–10:15 am		Rates of Convergence for 'Features' of a Markov Chain Persi Diaconis, Stanford University
10:25 am–11:10 am		Local Graph Coloring Alexander Holroyd, Microsoft Research
11:10 am–11:40 am		Break
11:40 am–12:25 pm		The Computational Complexity of Estimating Convergence Time Nayantara Bhatnagar, University of Delaware
12:25 pm–2:00 pm		Lunch
2:00 pm–2:45 pm		Local Algorithms for Community Detection Elchanan Mossel, UC Berkeley
2:55 pm–3:40 pm		Learning a Tree-Structured Ising Model in Order to Make Predictions Guy Bresler, MIT
3:40 pm–4:10 pm		Break
4:10 pm–4:55 pm		Generating Random Permutations Using Switching Networks Artur Czumaj, University of Warwick

Friday, February 26th, 2016
9:00 am–9:30 am		Coffee & Check-In
9:30 am–10:15 am		Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics Cris Moore, Santa Fe Institute
10:25 am–11:10 am		An Occupancy Approach to the Hard-Core Model Will Perkins, University of Birmingham
11:10 am–11:40 am		Break
11:40 am–12:25 pm		Equitable Rectangular Dissections of a Square Dana Randall, Georgia Institute of Technology