The number of sites visited by a random walk on a Cayley graph.
Time
May 23 2007 - 4:30pm - 5:30 pmLocation
CH 232Speaker
Lee Gibson (University of Louisville)Seminar Website
http://www.math.ohio-state.edu/~indira/GGT.htmlAbstract
In the 70's Donsker and Varadhan proved a precise log-limit for the negative
exponential moment of the number of sites visited by a simple random walk in
Z^d. Saloff-Coste and Pittet related this result to the return probability
of the random walk on the wreath product of Z^d with a finite group. In
this talk I will describe a coarse graining technique that provides the
log-asymptotic decay rate of the negative exponential moment of the number
of visited sites on the Cayley graphs of groups with polynomial volume
growth.
Last updated by Indira Chatterji on 05/18/07
