Gordon Slade (University of British Columbia)

The Self-Avoiding Walk

vendredi 2 octobre 2009, 14h00 - 15h00

Salle de réunion, espace Turing


Simple random walk is well understood. However, if we
condition a random walk not to intersect itself, so that it is a
self-avoiding walk, then it is much more difficult to analyze and
many of the important mathematical problems remain unsolved.
This lecture will give an overview of some of what is known about the
self-avoiding walk, including some old and some more recent results,
using methods that touch on combinatorics, probability, and
statistical mechanics.