Joint Mathematics Meetings Program by Special Session
Current as of Tuesday, April 12, 2005 15:09:55
Program 
Deadlines 
Inquiries: meet@ams.org
1999 Joint Mathematics Meetings
San Antonio, TX, January 1316, 1999
Meeting #939
Associate secretaries:
Susan J Friedlander, AMS susan@math.northwestern.edu
James J Tattersall, MAA tat@providence.edu
AMS Special Session on Probabilistic Combinatorics

Friday January 15, 1999, 8:00 a.m.10:50 a.m.
AMS Special Session on Probabilistic Combinatorics, I
Organizers:
B\'ela Bollob\'as, University of Memphis bollobas@msci.memphis.edu
Jeong Han Kim, Microsoft

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
(939111008)

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
(93960995)

9:00 a.m.
The subgaussian constant and concentration.
Prasad Tetali V Tetali*, Georgia Tech
(93905984)

9:30 a.m.
Large deviations for integer partitions.
Amir Dembo*, Stanford University
(939051039)

10:00 a.m.
Packing Random Rectangles.
Joel H. Spencer*, Courant Institute
(93905831)

10:30 a.m.
The size of hereditary properties of graphs.
Jozsef Balogh*, The University of Memphis
(939051160)

Friday January 15, 1999, 1:00 p.m.4:20 p.m.
AMS Special Session on Probabilistic Combinatorics, II
Organizers:
B\'ela Bollob\'as, University of Memphis bollobas@msci.memphis.edu
Jeong Han Kim, Microsoft

1:00 p.m.
A First Look at MultiType Percolation .
John C Wierman*, Johns Hopkins University
(93905832)

1:30 p.m.
Dependent percolation.
Paul N. Balister, University of Memphis
Bela Bollobas*, University of Memphis
Alan M. Stacey, University of Cambridge
(939601157)

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
(93960972)

2:30 p.m.
Total Path Length for Random Recursive Trees .
Robert P Dobrow*, Truman State University
James A Fill, The Johns Hopkins University
(9390588)

3:00 p.m.
Small complete arcs on finite projective planes.
Jeong Han Kim, Microsoft Research
Van H Vu*, Institute for Advance Study
(93905874)

3:30 p.m.
The Structure of Random Sumfree Sets.
Neil J Calkin*, Clemson University
Peter J. Cameron, Queen Mary and Westfield College
(93905871)

4:00 p.m.
Random walks on groups: how fast they mix and how to speed them up.
Igor Pak*, Yale University
(939601148)
MAA Online
Inquiries: meet@ams.org