COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Speed of random walksAdd to your list(s) Download to your calendar using vCal - Yuval Peres (Microsoft Research, Redmond)
- Tuesday 08 November 2011, 14:15-15:15
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.
If you have a question about this talk, please contact Julia Blackwell. How fast does a random walk on a graph escape from its starting point? In this survey talk, I will consider this question in a variety of settings:
RW on lamplighter groups: The Kaimanovich-Vershik Theorem
Benjamini-Lyons-Schramm conjecture: percolation preserves speed of RW
Surprisingly, the expected distance from the starting point can be non-monotone, even when starting at the stationary distribution and the walk has holding probability 1/2. *The square root lower bound on groups: Can it be proved beyond the inverse spectral gap? This talk is part of the Probability series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- DPMMS Lists
- DPMMS info aggregator
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
- Probability
- School of Physical Sciences
- Statistical Laboratory info aggregator
Note that ex-directory lists are not shown. |
## Other listsTanner Lectures Darwin Society (Christ's) McDonald Lectures & Seminars## Other talksMeditation Session at the Botanical Gardens Scott Lecture II : Counting and controlling photons non-destructively. Trust, Religion, and Tribalism: Reflections on the Sociological Data from the Balkans American Conspiracy Theories - GRAND ROUNDS- The Lee Tunnel – progress on the largest and deepest tunnel in London |