University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Bulk deviations for the simple random walk

Bulk deviations for the simple random walk

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

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

SSDW03 - Geometry, occupation fields, and scaling limits

In this talk we aim at establishing large-deviation estimates for the probability that the average value over a large box of some local observable of the field of occupation times of the simple random walk exceeds a given positive value. When the rare event occurs, we are in the presence of a certain “high density regime” and the random walk is locally well approximated by random interlacements with a slowly varying intensity. This can be used as a pivotal tool to obtain exact exponential rates for the probability of the deviant behaviour. In fact, the proof of the lower bound relies on the introduction of a near optimal strategy via the so called tilted walks – originally constructed by Li (2017) – which can be coupled with random interlacements at mesoscopic scales. Importantly, the lower bound matches at leading order the corresponding upper bound derived by Sznitman (2023), and is given in terms of a certain constrained variational problem. As an application, we look into the question of how costly it is for the simple random walk to disconnect an excessive fraction of points from an enclosing box. The talk is based on the joint work with M. Nitzschner (Hong Kong University of Science and Technology).

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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