Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Chen--Stein Method for the Uncovered Set of Random Walk on $\mathbb Z_n^d$ for $d \ge 3$ (1911.05581v3)

Published 13 Nov 2019 in math.PR

Abstract: Let $X$ be a simple random walk on $\mathbb{Z}nd$ with $d\geq 3$ and let $t{\rm{cov}}$ be the expected cover time. We consider the set of points $\mathcal{U}\alpha$ of $\mathbb{Z}_nd$ that have not been visited by the walk by time $\alpha t{\rm{cov}}$ for $\alpha\in (0,1)$. It was shown in [MS17] that there exists $\alpha_1(d)\in (0,1)$ such that for all $\alpha>\alpha_1(d)$ the total variation distance between the law of the set $\mathcal{U}_\alpha$ and an i.i.d. sequence of Bernoulli random variables indexed by $\mathbb{Z}_nd$ with success probability $n{-\alpha d}$ tends to $0$ as $n \to \infty$. In [MS17] the constant $\alpha_1(d)$ converges to $1$ as $d\to\infty$. In this short note using the Chen--Stein method and a concentration result for Markov chains of Lezaud we greatly simplify the proof of [MS17] and find a constant $\alpha_1(d)$ which converges to $3/4$ as $d\to\infty$.

Summary

We haven't generated a summary for this paper yet.