|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Speed of random walks
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:
Simple RW on Galton-Watson trees, where speed can be computed
RW on lamplighter groups: The Kaimanovich-Vershik Theorem
Which escape exponents are possible for RW on groups?
Benjamini-Lyons-Schramm conjecture: percolation preserves speed of RW
The effect of bias for RW on trees and on groups
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:
Note that ex-directory lists are not shown.
Other listsA Year at the Synapse: where Pre meets Post Amnesty - China Chasing childrens’ fortunes. Cases of parents strategies in Sweden, the UK and Korea.
Other talksOrr Lecture: Sir Harrison Birtwistle in interview with Richard Causton Monogenic Pain Disorders Sovereignty Rules: Human Rights Regimes and State Sovereignty Dark Energy: Is the Universe Playing Tricks on Us? The North American deglaciation: linking rapid climate change, ice sheet retreat and sea level rises Fowling things up for avian flu - transgenic intervention as an approach to combatting influenza infection in livestock.