Microsurveys in Discrete Probability

 Program 

 Monday, June 2, 1997

 9:00- 9:55 David Aldous, University of California - Berkeley
	    Tree- and forest-valued Markov processes

 9:55-10:15 Break 

10:15-11:10 Persi Diaconis, Cornell
	    New-wave Monte Carlo

11:10-11:20 Break 

11:20-11:40 Previews of the afternoon's talks

11:45- 1:30 Lunch

 1:30- 2:05 Jim Propp, MIT 
	    Coupling from the past: a user's guide

 2:05- 2:15 Break 

 2:15- 2:50 David Wilson, University of California - Berkeley
	    Generating random spanning trees

 2:50- 3:00 Break 

 3:00- 3:35 Karin Nelander 
	    Chalmers University of Technology and Gothenburg University 
	    Exact sampling from anti-monotone systems

 3:35- 4:00 Break

 4:00- 5:00 Problem session

 5:30- 6:30 Reception

 6:30-      Dinner


 Tuesday, June 3, 1997

 9:00- 9:55 Harry Kesten, Cornell University
	    Distinguishing and reconstructing sceneries from observations

 9:55-10:15 Break 

10:15-11:10 Russ Lyons, Indiana University and IAS (Jerusalem) 
	    Random spanning forests

11:10-11:20 Break

11:20-11:40 Previews of the afternoon's talks

11:45- 1:30 Lunch

 1:30- 2:05 Olle Haggstrom, Chalmers University of Technology 
	    Dynamical percolation: early results and open problems

 2:05- 2:15 Break

 2:15- 2:50 Steve Lalley, Purdue University
	    Growth processes on trees: the weak survival phase

 2:50- 3:00 Break

 3:00- 3:35 Peter Winkler, Bell Labs
	    Ramsey theory and sequences of random variables 

 3:35- 4:00 Break 

 4:00- 5:00 Problem session


 Wednesday, June 4, 1997

 9:00- 9:55 Boris Pittel, Ohio State University 
	    A phase transition phenomenon in the Erdos-Renyi 
            random graph process

 9:55-10:15 Break 

10:15-11:10 Ravi Kannan, Carnegie-Mellon University
	    Quick approximations to matrices

11:10-11:20 Break 

11:20-11:40 Previews of the afternoon's talks

11:45- 1:30 Lunch

 1:30- 2:05 Alan Frieze, 
            Greedy algorithms for the shortest common superstring 
            that are asymptotically optimal
 2:05- 2:15 Break

 2:15- 2:50 Anant Godbole, Michigan Tech University
	    A method of unbounded martingale differences, 
            with combinatorial applications

 2:50- 3:00 Break

 3:00- 3:35 David Zuckerman, University of Texas at Austin
	    Extractors and their applications

 3:35- 3:45 Break

 3:55- 4:30 Gesine Reinert, University of California, Los Angeles 
	    Coupling constructions for normal approximations 
            with Stein's method 
 
 4:40- 5:15 Intae Jeon, Ohio State University
	    Gelation phenomena

 Thursday, June 5, 1997

 9:00- 9:55 Richard Arratia, University of Southern California
	    On the central role of the scale invariant 
            Poisson processes on (0,infinity)

 9:55-10:15 Break

10:15-11:10 Laszlo Lovasz, Yale University
	    Mixing times for Markov chains

11:10-11:20 Break

11:20-11:40 Previews of the afternoon's talks

11:45- 1:30 Lunch

 1:30- 2:05 Martin Hildebrand, SUNY - Albany
	    Rates of convergence for a non-reversible
            version of the Metropolis algorithm

 2:05- 2:15 Break

 2:15- 2:50 Prasad Tetali, Georgia Tech 
	    Isoperimetric invariants for product Markov chains

 2:50- 3:00 Break

 3:00- 3:35 Dana Randall, Georgia Technology
	    Guarantees for efficiently sampling lattice 
            configurations

 3:35- 4:00 Break 

 4:00- 5:00 Problem session

 Friday, June 6, 1997 

 9:00- 9:55 Alistair Sinclair, University of California - Berkeley
	    Quadratic dynamical systems

 9:55-10:15 Break

10:15-11:10 Jim Fill, The Johns Hopkins University 
	    Probabilistic analysis of self-organizing search

11:10-11:20 Break 

11:20-11:40 TBA

11:45- 1:30 Closing lunch

Previous: Participation

Workshop Index

DIMACS Homepage