SMS 2012 Summer School “Probabilistic Combinatorics”

June 25 - July 6, 2012

Program

 

Monday, June 25, 2012

08:30 - 09:00
Registration and Coffee & Croissants
Room(s) 1221


Meeting room(s) : 1140

09:00 - 10:30
Alex Scott
(University of Oxford)
Cliques, colourings and discrepancy - I
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Prasad Tetali
(Georgia Institute of Technology)
Geometric and Functional Analysis on Discrete Spaces - I
Abstract
12:00 - 13:30
Lunch break
13:30 - 15:00
Peter Winkler
(Dartmouth College)
Random walk and electrical networks
Abstract
15:00 - 15:30
Coffee break
15:30 - 16:30
Perla Sousi
(University of Cambridge)
Markov chain mixing times: bounds and asymptotics - I
Abstract

 

Tuesday, June 26, 2012


Meeting room(s) : 1140

09:00 - 10:30
Peter Winkler
(Dartmouth College)
Cover time for vertices and for edges
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Perla Sousi
(University of Cambridge)
Markov chain mixing times: bounds and asymptotics - II
Abstract
12:00 - 13:30
Lunch break
13:30 - 15:00
Alex Scott
(University of Oxford)
Cliques, colourings and discrepancy - II
Abstract
15:00 - 15:30
Coffee break
15:30 - 16:30
Prasad Tetali
(Georgia Institute of Technology)
Geometric and Functional Analysis on Discrete Spaces - II
Abstract

16:30
Welcoming reception
Room(s) 6245

 

Wednesday, June 27, 2012


Meeting room(s) : 1140

09:00 - 10:30
Alex Scott
(University of Oxford)
Cliques, colourings and discrepancy - III
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Prasad Tetali
(Georgia Institute of Technology)
Geometric and Functional Analysis on Discrete Spaces - III
Abstract
12:00 - 13:30
Lunch break
13:30 - 15:00
Peter Winkler
(Dartmouth College)
Collision and avoidance
Abstract
15:00 - 15:30
Coffee break
15:30 - 16:30
Colin McDiarmid
(University of Oxford)
Colouring random graphs - I
Abstract

 

Thursday, June 28, 2012


Meeting room(s) : 1140

09:00 - 10:30
Yuval Peres
(Microsoft Research)
Markov chain mixing times and related topics - I
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Colin McDiarmid
(University of Oxford)
Colouring random graphs - II
Abstract
12:00 - 13:30
Lunch break
13:30 - 15:00
Alex Scott
(University of Oxford)
Cliques, colourings and discrepancy - IV
Abstract
15:00 - 15:30
Coffee break
15:30 - 16:30
Perla Sousi
(University of Cambridge)
Markov chain mixing times: bounds and asymptotics - III
Abstract

 

Friday, June 29, 2012


Meeting room(s) : 1140

09:00 - 10:30
Alex Scott
(University of Oxford)
Cliques, colourings and discrepancy - V
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Colin McDiarmid
(University of Oxford)
Colouring random graphs - III
Abstract
12:00 - 13:30
Lunch break
13:30 - 15:00
Peter Winkler
(Dartmouth College)
Pursuit and evasion
Abstract
15:00 - 15:30
Coffee break
15:30 - 17:00
Yuval Peres
(Microsoft Research)
Markov chain mixing times and related topics - II
Abstract

 

Monday, July 2, 2012


Meeting room(s) : 1140

09:00 - 10:30
Nikhil Bansal
(Eindhoven University)
Low discrepancy colorings and semidefinite programming - I
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Eric Vigoda
(Georgia Institute of Technology)
Markov chains for graph colourings - I
Abstract
12:00 - 13:30
Lunch break
13:30 - 15:00
James R. Lee
(University of Washington)
Cover times, Gaussian process and majorizing measures - I
Abstract
15:00 - 15:30
Coffee break
15:30 - 17:00
Peter Winkler
(Dartmouth College)
Branching random walk
Abstract

 

Tuesday, July 3, 2012


Meeting room(s) : 1140

09:00 - 10:30
James R. Lee
(University of Washington)
Cover times, Gaussian process and majorizing measures - II
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Eric Vigoda
(Georgia Institute of Technology)
Markov chains for graph colourings - II
Abstract
12:00 - 13:30
Lunch break
13:30 - 15:00
Nikhil Bansal
(Eindhoven University)
Low discrepancy colorings and semidefinite programming - II
Abstract
15:00 - 15:30
Coffee break
15:30 - 16:30
Hamed Hatami
(McGill University)
Influences and sharp thresholds - I
Abstract

 

Wednesday, July 4, 2012


Meeting room(s) : 1140

09:00 - 10:00
Eric Vigoda
(Georgia Institute of Technology)
Markov chains for graph colourings - III
Abstract
10:00 - 11:00
Penny Haxell
(University of Waterloo)
A topology-free topological method - I
Abstract
11:00 - 11:30
Coffee break
11:30 - 13:00
Nikhil Bansal
(Eindhoven University)
Low discrepancy colorings and semidefinite programming - III
Abstract
13:00
Lunch Break and Free Afternoon

 

Thursday, July 5, 2012


Meeting room(s) : 1140

09:00 - 10:30
Nikhil Bansal
(Eindhoven University)
Low discrepancy colorings and semidefinite programming - IV
Abstract
10:30 - 11:00
Coffee break
11:00 - 12:00
Penny Haxell
(University of Waterloo)
A topology-free topological method - II
Abstract
12:00 - 13:00
Hamed Hatami
(McGill University)
Influences and sharp thresholds - II
Abstract

 

Friday, July 6, 2012


Meeting room(s) : 1140

09:00 - 10:00
Hamed Hatami
(McGill University)
Influences and sharp thresholds - III
Abstract
10:00 - 11:00
Penny Haxell
(University of Waterloo)
A topology-free topological method - III
Abstract
11:00 - 11:30
Coffee break
11:30 - 13:00
Nikhil Bansal
(Eindhoven University)
Low discrepancy colorings and semidefinite programming - V
Abstract