Uniformity of the late points of random walk on Znd for d >= 3
Abstract
Suppose that X is a simple random walk on nd for d ≥ 3 and, for each t, we let (t) consist of those x ∈ nd which have not been visited by X by time t. Let be the expected amount of time that it takes for X to visit every site of nd. We show that there exists 0 < α0(d) ≤ α1(d) < 1 and a time t* = (1+o(1)) as n ∞ such that the following is true. For α > α1(d) (resp.\ α < α0(d)), the total variation distance between the law of (α t*) and the law of i.i.d.\ Bernoulli random variables indexed by nd with success probability~n-α d tends to~0 (resp.\ 1) as n ∞. Let τα be the first time t that |(t)| = nd-α d. We also show that the total variation distance between the law of (τα) and the law of a uniformly chosen set from nd with size nd-α d tends to 0 (resp.\ 1) for α > α1(d) (resp.\ α < α0(d)) as n ∞.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.