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

  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

On the Range of a Random Walk In a Torus

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Theatre 1, Department of Chemical Engineering & Biotechnology, New Museum Site, Pembroke Street CB2 3RA Lewin Stroke & Rehabilitation Unit, Seminar Room, R2, Addenbrooke's Hospital Computer Laboratory, SS03

Other talks

Online Causal Inference Seminar Discussion II title abstract tbc Understanding the Interplay between LLMs' Utilisation of Parametric and Contextual Knowledge Morning Break Zooming in on the assembly of galaxies in the early Universe
 

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