Full distribution of the number of distinct sites visited by a random walker in dimension d 2
Abstract
We study the full distribution PM(S) of the number of distinct sites S visited by a random walker on a d-dimensional lattice after M steps. We focus on the case d 2, and we are interested in the long-time limit M 1. Our primary interest is the behavior of the right and left tails of PM(S), corresponding to S larger and smaller than its mean value, respectively. We present theoretical arguments that predict that in the right tail, a standard large-deviation principle (LDP) PM(S) e-M(S/M) is satisfied (at M 1) for d2, while in the left tail, the scaling behavior is PM(S) e-M1-2/d(S/M), corresponding to a LDP with anomalous scaling, for d>2. We also obtain bounds for the scaling functions (a) and (a), and obtain analytical results for (a) in the high-dimensional limit d 1, and for (a) in the limit a 1 (describing the far left tail). Our predictions are validated by numerical simulations using importance sampling algorithms.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.