8:00 a.m. One deletion and on average $1+\epsilon$ insertions, of prime factors, suffices to convert a uniformly chosen random integer to one whose prime factors have independent multiplicities . Richard A. Arratia*, Univ. Southern California
(939-11-1008)
8:30 a.m. Exponentially Slow Mixing for Monte Carlo Markov Chains. Christian Borgs*, Microsoft Research
Jennifer Tour Chayes, Microsoft Research
Alan Frieze, Carnegie Mellon
Jeong Han Kim, Microsoft Research
Prasad Tetali, Georgia Tech
Eric Vigoda, UC Berkeley
Van H Vu, Institute for Advanced Study
(939-60-995)
9:00 a.m. The subgaussian constant and concentration. Prasad Tetali V Tetali*, Georgia Tech
(939-05-984)
9:30 a.m. Large deviations for integer partitions. Amir Dembo*, Stanford University
(939-05-1039)
10:00 a.m. Packing Random Rectangles. Joel H. Spencer*, Courant Institute
(939-05-831)
10:30 a.m. The size of hereditary properties of graphs. Jozsef Balogh*, The University of Memphis
(939-05-1160)
1:00 p.m. A First Look at Multi-Type Percolation . John C Wierman*, Johns Hopkins University
(939-05-832)
1:30 p.m. Dependent percolation. Paul N. Balister, University of Memphis
Bela Bollobas*, University of Memphis
Alan M. Stacey, University of Cambridge
(939-60-1157)
2:00 p.m. Scaling Limits for Minimal and Random Spanning Trees in Two Dimensions. Michael Aizenman, Princeton University
Almut Burchard, University of Virginia
Charles M Newman, Courant Institute
David B Wilson*, Microsoft
(939-60-972)
2:30 p.m. Total Path Length for Random Recursive Trees . Robert P Dobrow*, Truman State University
James A Fill, The Johns Hopkins University
(939-05-88)
3:00 p.m. Small complete arcs on finite projective planes. Jeong Han Kim, Microsoft Research
Van H Vu*, Institute for Advance Study
(939-05-874)
3:30 p.m. The Structure of Random Sum-free Sets. Neil J Calkin*, Clemson University
Peter J. Cameron, Queen Mary and Westfield College
(939-05-871)
4:00 p.m. Random walks on groups: how fast they mix and how to speed them up. Igor Pak*, Yale University
(939-60-1148)