Workshop Programme

for period 25-28 March

25-28 March

Timetable

Tuesday 25 March
08:30-09:55	Registration	CSM
10:00-11:00	Vigoda, E (Georgia Institute)	CSM
	Random colorings	Sem 1
11:10-11:40	Coffee	CSM
11:40-12:30	Peres, Y (Microsoft Research)	CSM
	Can extra updates delay mixing?	Sem 1
12:30-13:30	Lunch at Wolfson Court	CSM
14:00-14:30	Greenhill, C (New South Wales)	CSM
	Asymptotic enumeration of contingency tables	Sem 1
14:35-15:05	Cameron, PJ (London)	CSM
	A Markov chain for certain triple systems	Sem 1
15:10-15:40	Tea	CSM
15:40-16:10	Luczak, M (LSE)	CSM
	Glauber dynamics for the Ising Model on the Complete Graph	Sem 1
16:15-16:45	Kannan, R (Microsoft Research Labs., India)	CSM
	A new probability inequality and some optimal concentration results	Sem 1
16:50-17:20	Levin, D (Oregon)	CSM
	Ising Model on Kn: mixing time for Glauber dynamics at critical ϐ	Sem 1
17:30-18:30	Welcome Wine Reception	CSM
18:45-19:30	Dinner at Wolfson Court (Residents only)	CSM

Wednesday 26 March
09:30-10:30	Martinelli, F (Roma)	CSM
	The east model: a case study from glassy dynamics	Sem 1
10:35-11:05	Sly, A (UC Berkeley)	CSM
	Rapid mixing of Gibbs sampling on graphs that are sparse on average	Sem 1
11:10-11:40	Coffee	CSM
11:40-12:10	Fill, JA (Johns Hopkins)	CSM
	On hitting times and fastest strong stationary times for birth-and-death chains and other skip-free chains	Sem 1
12:30-13:30	Lunch at Wolfson Court	CSM
14:00-14:30	Lubetzky, E (Microsoft Research)	CSM
	Cutoff in total variation for birth-and-death chains	Sem 1
14:35-15:05	Montenegro, R (Massachusetts Lowell)	CSM
	A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm	Sem 1
15:10-15:40	Tea	CSM
15:40-16:10	Bordewich, M (Durham)	CSM
	Path coupling without contraction	Sem 1
16:15-16:45	Dyer, M (Leeds)	CSM
	Colouring random graphs randomly	Sem 1
16:50-17:20	Cooper, C (Kings College London)	CSM
	Multiple random walks in random regular graphs	Sem 1
19:30-23:00	Conference Dinner - Corpus Christi College (The Dining Hall)	CSM

Thursday 27 March
09:30-10:00	Tetali, P (Georgia Tech)	CSM
	Parking functions and acyclic orientations	Sem 1
10:05-10:35	van den Berg, J (CWI)	CSM
	Rapidly mixing Markov chains and the sharp transition in 2D ising percolation	Sem 1
10:40-11:10	Frieze, A (Carnegie Mellon)	CSM
	Log-concave random graphs	Sem 1
11:10-11:40	Coffee	CSM
11:40-12:10	Shlosman, S (CNRS)	CSM
	Properties of the interfaces in the multyphase regimes	Sem 1
12:30-13:30	Lunch at Wolfson Court	CSM
14:00-14:30	Randall, D (Sao Paulo State)	CSM
	Proving slow mixing with fault lines and fat contours	Sem 1
14:35-15:05	Sokal, A (UCL and NYU)	CSM
	An introduction to dynamic critical phenomena and cluster algorithms	Sem 1
15:10-15:40	Tea	CSM
15:40-16:10	Machta, J (Massachusetts)	CSM
	Graphical representations and cluster algorithms	Sem 1
16:15-17:00		CSM
	Open problem session	Sem 1
17:00-17:30	Wine and Cheese Reception	CSM
18:45-19:30	Dinner at Wolfson Court (Residents only)	CSM

Friday 28 March
09:30-10:00	Wilson, D (Microsoft Research)	CSM
	Card shuffling and Diophantine approximation	Sem 1
10:05-10:35	Bou-Rabee, N (California Institute)	CSM
	Near Boltzmann-Gibbs measure preserving stochastic variational integrator	Sem 1
10:40-11:10	Scoppola, B (Roma)	CSM
	Randomised algorithms for the maximum clique problem	Sem 1
11:10-11:40	Coffee	CSM
11:40-12:10	Berestycki, N (Cambridge)	CSM
	What happens to a random walk before equilibrium?	Sem 1
12:15-12:45	Czumaj, A (Warwick)	CSM
	Testing expansion in bounded degree graphs	Sem 1
12:45-13:30	Lunch at Wolfson Court	CSM
14:00-14:30	Allanach, BC (Cambridge)	CSM
	Bank sampling: a practical proposal for sampling from isolated maxima with the Metropolis algorithm	Sem 1
14:35-15:05	Bhatnagar, N (UC Berkeley)	CSM
	Extremality of Gibbs measure for colorings on trees	Sem 1
15:05-15:35	Tea	CSM
18:45-19:30	Dinner at Wolfson Court (Residents only)	CSM

Other Seminars