THEMATIC PROGRAMS

July 31, 2014

Special Year on Graph Theory and Combinatorial Optimization Program

PROBABILISTIC GRAPH THEORY WORKSHOP



FEBRUARY 14 - 19, 2000
SCHEDULE

Monday, February 14, 2000
9:00 - 9:30 a.m. Registration at the Fields Institute
9:30 - 10:30 a.m. Joel Spencer - Random Processes
10:30 - 11:00 a.m. BREAK
11:00 - 11:30 a.m. Tom Bohman - Vertex covers by edge disjoint cliques
11:30 - 12:00 p.m. Ehud Friedgut - Ramsey properties of random graphs and related threshold phenomena
12:00 - 3:00 p.m. LUNCH
3:00 - 4:00 p.m. Jennifer Chayes - Finite Size Scaling in 2-SAT
4:00 - 4:30 p.m. TEA-TIME
4:30 - 5:00 p.m. David Wilson - The Scaling Window of the 2-SAT Transition
5:00 - 5:30 Boris Pittel - On a threshold phenomenon for the optimum partition of a set of random integers
Tuesday, February 15, 2000
9:30 - 10:30 a.m. Noga Alon - Universal graphs for bounded degree graphs
10:30 - 11:00 a.m. BREAK
11:00 - 11:30 a.m. Michael Krivelevich - Sparse graphs usually have exponentially many optimal colorings
11:30 - 12:00 p.m. Dimitris Achlioptas - Threshold phenomena in random graph coloring and satisfiability
12:00 - 3:30 p.m. LUNCH
3:30 - 4:00 p.m. Benny Sudakov - Nowhere-zero flows in random graphs
4:00 - 4:30 p.m. TEA-TIME
4:30 - 5:30 p.m. Bruce Reed - The asymptotics of the list chromatic index
5:30 - 8:00 p.m. RECEPTION
Wednesday, February 16, 2000
11:00 - 11:30 a.m. Ljubomir Perkovic - The expected value of a minimum weight d-dimensional matching
11:30 - 12:00 p.m. Gregory Sorkin - What's new in Random Assignment
12:00 p.m. Free Afternoon
Thursday, February 17, 2000
9:30 - 10:30 a.m. Michael Steele - How to Use Sharp Concentration Inequalities
10:30 - 11:00 a.m. BREAK
11:00 - 11:30 a.m. Nick Wormald - How many graphs have maximum degree n/2
11:30 - 12:00 p.m. Jason Gao - Sharp concentration of the number of submaps in random planar triangulations
12:00 - 3:00 p.m. LUNCH
3:00 - 3:30 p.m. Santosh Venkatesh - Lookahead complexity
3:30 - 4:00 p.m. Ralph Neininger - Limit laws for parameters of random point quadtrees
Friday, February 18, 2000
9:30 - 10:30 a.m. Luc Devroye - Random multidimensional search trees
10:30 - 11:00 a.m. BREAK
11:00 - 11:30 a.m. Van Vu - Concentration of multi-variate polynomials and applications
11:30 - 12:00 p.m. Daniel Panario - Exact largest and smallest size of components in decomposable structures
12:00 - 2:00 p.m. LUNCH
Saturday, February 19, 2000
9:00 a.m. - 6:00 p.m. COLLABORATION