Probabilistic methods and ideas have by now become central to large parts of discrete mathematics and theoretical computer science, too much so to allow a convenient summary here. At the same time, recent years have seen a number of major developments in parts of probability and statistical mechanics dealing with topics of an essentially discrete nature (e.g. percolation, random walks and Markov chains, particle systems, branching processes).
A major goal of this program is to foster interaction between these communities. This is already happening to some extent, with both the application of increasingly sophisticated tools from probability to DM and TCS, and the solution of problems from probability by combinatorial means. Nonetheless, such interactions, and even awareness of what these communities have to offer each other, are still far more exception than rule. So the program is intended to give a substantial push to a broader and more rapid development of these connections.
Opportunities to participate include postdoctoral appointents, long and short term visitors, and workshops. Applicants for visitor positions should contact the organizing committee chairs.
Other activities planned include workshops and lectures. Workshops in (approximate) planning stages include: