AMS Sectional Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:10:02
Program 
Deadlines 
Registration/Housing/Etc. 
Inquiries: meet@ams.org
1999 Fall Southeastern Section Meeting
Charlotte, NC, October 1517, 1999
Meeting #949
Associate secretaries:
John L Bryant, AMS
bryant@math.fsu.edu
Special Session on Applied Probabilistic Combinatorics

Friday October 15, 1999, 2:30 p.m.6:20 p.m.
Special Session on Applied Probabilistic Combinatorics, I
Room 105, Denny Hall
Organizers:
Bela Bollob\'as, University of Memphis bollobas@msci.memphis.edu
Gregory Sorkin, IBM T.J. Watson Research Center sorkin@watson.ibm.com

2:30 p.m.
Coalescent trees and the age of a mutation.
Robert C Griffiths, University of Oxford
Simon Tavar\'e*, UNiversity of Southern California
(9496071)

3:00 p.m.
Random ThreeDimensional Tilings of Aztec Octahedra and Tetrahedra: An Extension of Domino Tilings.
Dana Randall*, Georgia Institute of Technology
Gary Yngve, Georgia Institute of Technology
(94905182)

3:30 p.m.
The sizes and speeds of properties of graphs.
David Weinreich*, The University of Memphis
Bela Bollobas, The University of Memphis and Cambridge University
Jozsef Balog, The University of Memphis
(94905227)

4:00 p.m.
Graphical Representations of the Potts Model in a Magnetic Field.
Marek Biskup, Microsoft Research
Christian Borgs*, Microsoft Research
Jennifer T Chayes, Microsoft Research
Roman Kotecky, Center for Theoretical Study
(94982226)

4:30 p.m.
Discounted Reward Markov Decision Process is Undecidable.
Anne E Condon*, University of British Columbia
(94968109)

5:00 p.m.
Random matchings which induce Hamilton cycles, and Hamiltonian decompositions of random regular graphs.
Jeong Han Kim*, Microsoft Research
Nick C. Wormald, University of Melbourne
(9490584)

5:30 p.m.
01 Laws for Single Molecules.
Bud Mishra*, Courant Institute, NYU
(9490567)

6:00 p.m.
Discussion

Saturday October 16, 1999, 8:30 a.m.10:50 a.m.
Special Session on Applied Probabilistic Combinatorics, II
Room 105, Denny Hall
Organizers:
Bela Bollob\'as, University of Memphis bollobas@msci.memphis.edu
Gregory Sorkin, IBM T.J. Watson Research Center sorkin@watson.ibm.com

8:30 a.m.
DNA sequencing, Euler circuits, and graph polynomials.
Richard Arratia, U.S.C.
Bela Bollobas, Univ. of Cambridge / Memphis Univ.
Don Coppersmith, IBM Watson Research Ctr.
Gregory B Sorkin*, IBM Watson Research Ctr.
(9490583)

9:00 a.m.
The interlace polynomial: a new graph polynomial.
Richard Arratia, University of Southern California, Los Angeles CA
B\'ela Bollob\'as*, University of Memphis, Memphis TN
Gregory B Sorkin, IBM T. J. Watson Research Center
(94905218)

9:30 a.m.
On the impossibility of closedform partition functions for the 3D Ising model across lattices.
Sorin I Istrail*, Sandia National Laboratories
(94982153)

10:00 a.m.
A Survey of Subshifts of Finite Type and Measures of Maximal Entropy.
Jeffrey E Steif*, Georgia Institute of Technology
(9490569)

10:30 a.m.
Phylogeny needs more probability for sure.
Laszlo A Szekely*, University of South Carolina
(94992122)

Saturday October 16, 1999, 2:30 p.m.6:40 p.m.
Special Session on Applied Probabilistic Combinatorics, III
Room 105, Denny Hall
Organizers:
Bela Bollob\'as, University of Memphis bollobas@msci.memphis.edu
Gregory Sorkin, IBM T.J. Watson Research Center sorkin@watson.ibm.com

2:30 p.m.
Anisotropic SelfAvoiding Walks: The Existence of a Phase with Nontrivial Negative Masses.
Christian H Borgs, Microsoft Research
Jennifer T Chayes*, Microsoft Research
Chris King, Northeastern University
Neal Madras, York University
(94960225)

3:00 p.m.
Equivalent Conditions of Regularity.
Yoshiharu Kohayakawa, University of Sao Paulo, Brasil
Vojtech Rodl, Emory University
Jozef Skokan*, Emory University
(94905251)

3:30 p.m.
Broadcasting on Trees and the Ising Model.
William Evans, U. Arizona
Claire Kenyon, LRI, Universite de ParisSud
Yuval Peres, Hebrew University and U. C. Berkeley
Leonard J Schulman*, Georgia Tech
(9496095)

4:00 p.m.
Edge disjoint paths in expander graphs.
Alan M Frieze*, Carnegie Mellon University
(9496885)

4:30 p.m.
Interruptible perfect sampling.
Mark L Huber*, Stanford University
(94960104)

5:00 p.m.
Correlation decay in random tilings.
Rick Kenyon, Orsay
Robin Pemantle*, Ohio State University
(94905252)

5:30 p.m.
Upper and lower bounds for the time constant of firstpassage percolation.
Sven Erick Alm*, Uppsala University
(94960142)

6:20 p.m.
Discussion

Sunday October 17, 1999, 9:30 a.m.12:50 p.m.
Special Session on Applied Probabilistic Combinatorics, IV
Room 105, Denny Hall
Organizers:
Bela Bollob\'as, University of Memphis bollobas@msci.memphis.edu
Gregory Sorkin, IBM T.J. Watson Research Center sorkin@watson.ibm.com

9:30 a.m.
Counting Independent Sets in the Grid.
Neil J Calkin*, Clemson University
(94905235)

10:00 a.m.
Mick gets more than pie.
Dimitris Achlioptas*, Microsoft Research
(9490570)

10:30 a.m.
Confirming KleitmanWinston conjecture on the largest coefficient in a qCatalan number.
Boris G Pittel*, Ohio State University
Jeong Han Kim, Microsoft
(94905168)

11:00 a.m.
Bounds for Critical Probabilities in Percolation Models.
John C Wierman*, Johns Hopkins University
(9490552)

11:30 a.m.
Entanglement in 3D percolation.
Olle Haggstrom*, Chalmers University of Technology
(94960155)

12:00 p.m.
Discussion

12:30 p.m.
Discussion
Inquiries: meet@ams.org