Workshop I: Probabilistic Techniques and Applications - IPAM

Workshop I: Probabilistic Techniques and Applications

Part of the Long Program Combinatorics: Methods and Applications in Mathematics and Computer Science
October 5 - 9, 2009

Schedule

All times in this Schedule are Pacific Time (PT)

Monday, October 5, 2009

Morning Session

08:00-08:50
Check-In/Light Breakfast (Hosted by IPAM)
08:50-09:00
Welcome and Opening Remarks
09:00-09:50
Yuval Peres (Microsoft Research)
Mixing Time and Diameter in Random Graphs
10:00-10:15
Break
10:15-11:05
Angelika Steger (ETH Zürich)
On the Evolution of K_k-free Graphs
11:15-11:30
Break
11:30-12:20
David Gamarnik (Massachusetts Institute of Technology)
A Combinatorial Approach to Guerra's Interpolation Method

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Eyal Lubetzky (Microsoft Research)
Martingales, Large Deviations and Bounds on Adaptive Algorithms
15:30-16:00
Break
16:00-17:30
()
<b>Public Lecture:</b> The Combinatorics of Voting Paradoxes
17:30
Reception (Location: IPAM Lobby)

Tuesday, October 6, 2009

Morning Session

08:15-09:00
Continental Breakfast
09:00-09:50
Thomas Liggett (University of California, Los Angeles (UCLA))
A Proof of Aldous' Spectral Gap Conjecture
10:00-10:15
Break
10:15-11:05
Amin Coja-Oghlan (University of Edinburgh)
A Better Algorithm for Random k-SAT
11:15-11:30
Break
11:30-12:20
Nick Wormald (University of Waterloo)
Load Balancing and Random Graphs

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Béla Bollobás (University of Cambridge)
Probabilistic Cellular Automata
15:30-15:45
Break
15:45-16:35
Tom Bohman (Carnegie-Mellon University)
The H-free Process
16:45-17:00
Break
17:00-17:50
Jeff Kahn (Rutgers University)
The Number of 3-SAT Functions

Wednesday, October 7, 2009

Morning Session

08:15-09:00
Continental Breakfast
09:00-09:50
()
Chromatic Coding
10:00-10:15
Break
10:15-11:05
Michael Krivelevich (Tel Aviv University)
The Critical Bias for the Hamiltonicity Game is n/ln n
11:15-11:30
Break
11:30-12:20
Artur Czumaj (University of Warwick)
Local Explorations of Planar Graphs and Fast Property Testing

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Fan Chung-Graham (University of California, San Diego (UCSD))
Percolation on General Graphs
15:30-16:00
Break
16:00-16:50
Rob Morris (Institute of Pure and Applied Mathematics (IMPA))
Bootstrap Percolation in High Dimensions

Thursday, October 8, 2009

Morning Session

09:30-10:15
Continental Breakfast
10:15-11:05
Van Vu (Rutgers University)
Some Recent Results on Random Matrices
11:15-11:30
Break
11:30-12:20
Alan Frieze (Carnegie-Mellon University)
Hamilton Cycles in Random Graphs

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
József Balogh (University of Illinois at Urbana-Champaign)
The Typical Structure of Graphs without Given Excluded Subgraphs
15:30-15:45
Break
15:45-16:35
Alexander Scott (University of Oxford)
Triangles in Random Graphs
16:45-17:00
Break
17:00-17:50
Sebastien Roch (University of Wisconsin-Madison)
Probabilistic Techniques in Mathematical Phylogenetics
Printable Version