Papers
Topics
Authors
Recent
Search
2000 character limit reached

Uniformity of the late points of random walk on Z_n^d for d >= 3

Published 12 Sep 2013 in math.PR, math-ph, and math.MP | (1309.3265v1)

Abstract: Suppose that $X$ is a simple random walk on $\Z_nd$ for $d \geq 3$ and, for each $t$, we let $\U(t)$ consist of those $x \in \Z_nd$ which have not been visited by $X$ by time $t$. Let $\tcov$ be the expected amount of time that it takes for $X$ to visit every site of $\Z_nd$. We show that there exists $0 < \alpha_0(d) \leq \alpha_1(d) < 1$ and a time $t_* = \tcov(1+o(1))$ as $n \to \infty$ such that the following is true. For $\alpha > \alpha_1(d)$ (resp.\ $\alpha < \alpha_0(d)$), the total variation distance between the law of $\U(\alpha t_*)$ and the law of i.i.d.\ Bernoulli random variables indexed by $\Z_nd$ with success probability~$n{-\alpha d}$ tends to~$0$ (resp.\ $1$) as $n \to \infty$. Let $\tau_\alpha$ be the first time $t$ that $|\U(t)| = n{d-\alpha d}$. We also show that the total variation distance between the law of $\U(\tau_\alpha)$ and the law of a uniformly chosen set from $\Z_nd$ with size $n{d-\alpha d}$ tends to $0$ (resp.\ $1$) for $\alpha > \alpha_1(d)$ (resp.\ $\alpha < \alpha_0(d)$) as $n \to \infty$.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.