University of Cambridge > Talks.cam > Probability > Speed of random walks

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Speed of random walks

Download to your calendar using vCal

If you have a question about this talk, please contact HoD Secretary, DPMMS .

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 lists

Lecture Theatre, Level 7, www.mrc-dunn.cam.ac.uk Lecture Theatre 1 at the Judge Business Webinar & FW11, Computer Laboratory, William Gates Building.

Other talks

Non-stationarity in structural dynamics, challenges and implications for modelling and structural health monitoring Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? Morning Tea and Coffee Welfare Reform and the Imperative of Cooperation Title to be confirmed A Few Days in Patagonia - the Deep South
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity