Joint Mathematics Meetings Program by Special Session
Current as of Tuesday, April 12, 2005 15:21:37
Program 
Deadlines 
Inquiries: meet@ams.org
Joint Mathematics Meetings
Phoenix, AZ, January 710, 2004
Meeting #993
Associate secretaries:
Michel L Lapidus, AMS lapidus@math.ucr.edu, lapidus@mathserv.ucr.edu
James J Tattersall, MAA tat@providence.edu
AMS Special Session on Probability and Its Applications in Combinatorics and Algorithms

Wednesday January 7, 2004, 9:00 a.m.10:50 a.m.
AMS Special Session on Probability and Its Applications in Combinatorics and Algorithms, I
Organizers:
Russell D. Lyons, Indiana University
Yuval Peres, University of California Berkeley peres@stat.berkeley.edu

9:00 a.m.
The Simplest Game in the World.
Yuliy Baryshnikov, Bell Labs
Peter Winkler*, Bell Labs
(993051337)

10:00 a.m.
Asymptotic Enumeration of Spanning Trees.
Russell D Lyons*, Indiana University
(993051185)

10:30 a.m.
Mixing time for the biased card shuffling and the assymetric exclusion process.
Noam Berger*, Caltech
Elchanan Mossel, U.C. Berkeley
Christopher E. Hoffman, University of Washington
Itai Benjamini, The Weizmann Institute
(993601713)

Wednesday January 7, 2004, 2:15 p.m.5:55 p.m.
AMS Special Session on Probability and Its Applications in Combinatorics and Algorithms, II
Organizers:
Russell D. Lyons, Indiana University
Yuval Peres, University of California Berkeley peres@stat.berkeley.edu

2:15 p.m.
Monte Carlo tests of conformal invariance and SLE predictions for the twodimensional selfavoiding walk.
Tom G Kennedy*, University of Arizona
(993601172)

3:15 p.m.
Level sets and flow lines of the Gaussian free field.
Scott Sheffield*, Microsoft Research
Oded Schramm, Microsoft Research
(993601662)

4:15 p.m.
Asymptotics of random discrete interfaces.
Richard Kenyon*, Universit\'e ParisSud
(993601542)

5:15 p.m.
Random walk and random aggregation without randomness.
Alexander E. Holroyd, University of British Columbia
Lionel Levine, U. C. Berkeley
James G. Propp*, U. Wisconsin  Madison
(993601071)

Thursday January 8, 2004, 9:00 a.m.11:50 a.m.
AMS Special Session on Probability and Its Applications in Combinatorics and Algorithms, III
Organizers:
Russell D. Lyons, Indiana University
Yuval Peres, University of California Berkeley peres@stat.berkeley.edu

9:00 a.m.
A Tractable Stochastic Model of Complex Networks.
David J Aldous*, U.C. Berkeley
(993601136)

10:00 a.m.
A Stable Marriage of Poisson and Lebesgue.
Chris Hoffman, University of Washington
Alexander Holroyd, University of British Columbia
Yuval Peres*, University of California, Berkeley
(993601609)

10:30 a.m.
How independent are the branches of a search tree?
Cristopher Moore*, University of New Mexico
(993601491)

11:00 a.m.
The mixing time for simple exclusion.
Ben J Morris*, Indiana University
(993601691)

11:30 a.m.
Combinatorial evaluations of the Tutte polynomial and Ttetromino tilings.
Michael Korn, MIT
Igor Pak*, MIT
(993051413)

Thursday January 8, 2004, 1:00 p.m.3:40 p.m.
AMS Special Session on Probability and Its Applications in Combinatorics and Algorithms, IV
Organizers:
Russell D. Lyons, Indiana University
Yuval Peres, University of California Berkeley peres@stat.berkeley.edu

1:00 p.m.
Discussion.

1:30 p.m.
Nonmonotonic outcomes in elections.
Anthony Quas*, University of Memphis
(993601417)

2:00 p.m.
On Random Points in the Unit Disk.
Catherine H Yan*, Texas A&M University
Xingde Jia, Southwest Texas State University
Robert Ellis, Texas A&M University
(99305137)

2:30 p.m.
Nonuniqueness of Gibbs Measures for transition functions.
Christopher Hoffman*, Universtiy of Washington
(993601328)

3:00 p.m.
Zeros of i.i.d. Gaussian power series.
Balint Virag*, University of Toronto
(993601618)
MAA Online
Inquiries: meet@ams.org