|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 listsCambridge University Expeditions Society Why Deep Neural Networks Are Promising for Speech Recognition Health and Welfare Reading Group
Other talksMathematical Aspects of local vs. global risk analysis: II Application of robust nonlinear model predictive control to simulating the control behaviour of a racing driver Fluid-Solid interaction with flow: Do sound absorbers in aircraft engines generate turbulence? Professor Kim Nasmyth - Title to be confirmed How Stressed Can Stabled Horses Be? The Development of a Behaviour Stress Scale to Assess the Welfare of Stabled Horses TBC (integration of visual information in fly brains)