BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Speed of random walks - Yuval Peres (Microsoft Research\, Redmond)
DTSTART:20111108T141500Z
DTEND:20111108T151500Z
UID:TALK34101@talks.cam.ac.uk
CONTACT:HoD Secretary\, DPMMS
DESCRIPTION: How fast does a random walk on a graph escape from its starti
 ng\npoint? In this survey talk\, I will consider this question in a variet
 y of\nsettings:\n\n*Simple RW on Galton-Watson trees\, where speed can be 
 computed\n\n*RW on lamplighter groups: The Kaimanovich-Vershik Theorem\n\n
 *Which escape exponents are possible for RW on groups?\n\n*Benjamini-Lyons
 -Schramm conjecture: percolation preserves speed of RW\n\n*The effect of b
 ias for RW on trees and on groups\n\n*Surprisingly\, the expected distance
  from the starting point can be\nnon-monotone\,\n  even when starting at t
 he stationary distribution and the walk has\n  holding probability 1/2.\n\
 n*The square root lower bound on groups: Can it be proved beyond the inver
 se\nspectral gap?\n\n
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR