|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 listshistory Seminar on Religion, Conflict and Its Aftermath Causal Inference Seminar and Discussion Group
Other talksEvolution of visual pigments in New and Old World warblers: from genes to function TBC TBC (SP Workshop) Polynomial Pick forms for affine spheres, real projective polygons, and surface group representations in PSL(3,R). Roles of cytoskeleton in hippocampal synaptic plasticity Translational Funders Day