2:10 p.m. Perfect matchings in random graphs with prescribed minimal degree. Alan M Frieze*, Carnegie Mellon University
Boris G Pittel, Ohio State University
(975-60-144)
3:10 p.m. Pseudo-random graphs. Michael Krivelevich*, Tel Aviv University
(975-05-216)
4:10 p.m. On Avoiding A Giant Component. Tom Bohman*, Carnegie Mellon University
Alan Frieze, Carnegie Mellon University
Nicholas Wormald, University of Melbourne
(975-05-332)
4:40 p.m. Divide and Conquer Martingales. Van H. Vu*, Department of Mathmatics, UCSD
(975-05-126)
3:05 p.m. Knockin' 'em Down, One After Another. James Allen Fill*, Department of Mathematical Sciences, The Johns Hopkins University
David Bruce Wilson, Theory Group, Microsoft Research
(975-60-375)
4:05 p.m. Anatomy of a permutation. Andrew Granville*, University of Georgia
(975-05-378)
4:35 p.m. Two questions on coins with unknown bias. Yuval Peres*, University of California, Berkeley
(975-60-418)
5:35 p.m. On the meeting point for random spanning trees. Philippe Marchal*, CNRS and Georgia Tech
(975-60-276)
10:10 a.m. A Markov Random Field Model of Multicasting. Kavita Ramanan*, Bell Labs, Lucent Technologies
Ilze Ziedins, University of Auckland, New Zealand
Anirvan Sengupta, Bell Labs, Lucent Technologies
Partha Mitra, Bell Labs, Lucent Technologies
(975-00-274)
10:40 a.m. Mixing time for biased card shuffling. Itai Benjamini, Weitzmann institute
Noam Beger, U.C Berkeley
Chris Hoffman, University of Washington
Elchanan Mossel*, Microsoft Research
(975-60-203)
11:10 a.m. A new, probabilistic approach for heat kernel bounds. Ben Morris*, University of California, Berkeley
(975-60-341)
11:40 a.m. Decomposition, Swapping and Mean-Field Models. Dana Randall*, Georgia Tech
(975-60-358)