University of Cambridge > > Probability > On the Range of a Random Walk In a Torus

On the Range of a Random Walk In a Torus

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Berestycki.

Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices visited by the walk. Distance and mixing bounds for the typical range are proven that are a k-iterated log factor from those on the full torus for arbitrary k. The proof uses hierarchical renormalization and techniques that can possibly be applied to other random processes in the Euclidean lattice.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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