The precise location is Lecture room E2, Lindstedtsvägen 3, KTH. Click here for a map of the KTH campus.
The symposium will focus on discrete probability, combinatorics, algorithms, and theoretical computer science, as well as on applications of and interactions between these subjects.
The following is a tentative schedule of the meeting.
|WEDNESDAY, AUGUST 22|
|13.00-13.45||Russ Lyons (Indiana University and Georgia Tech)||Uniform and minimal spanning forests|
|14.00-14.45||Alistair Sinclair (UC Berkeley)||Approximating the permanent of a matrix with non-negative entries|
|15.15-16.00||Elchanan Mossel (Microsoft Research)||Glauber dynamics on trees and hyperbolic graphs|
|16.15-17.00||Lars Holst (KTH)||On the longest cycle and records in a random permutation|
|18.30-???||Conference dinner at Wijnjas Ostkällare|
|THURSDAY, AUGUST 23|
|10.00-10.45||Jeff Steif (Georgia Tech and Chalmers)||An overview of the hard core model|
|11.15-12.00||Johan Håstad (KTH)||Probabilistically checkable proofs and inapproximability of NP-hard optimization problems|
|13.30-14.15||Kimmo Eriksson (Mälardalen University)||Finite random spanning trees and random assignments|
|14.30-15.15||Peter Winkler (Bell Labs)||Optimality and greed in dynamic allocation|
First announcement (in postscript).
The symposium is sponsored by the Stochastic Centre at Chalmers, and by the Swedish Natural Science Research Council.