Chen--Stein Method for the Uncovered Set of Random Walk on $\mathbb Z_n^d$ for $d \ge 3$
Sam Olesker-Taylor, Perla Sousi

TL;DR
This paper simplifies the proof of a previous result on the uncovered set of a random walk on high-dimensional tori, using the Chen--Stein method, and refines the asymptotic behavior of a key constant as the dimension grows.
Contribution
The authors provide a simplified proof of the asymptotic behavior of the uncovered set in high dimensions and improve the constant's limit from 1 to 3/4.
Findings
Simplified proof of the uncovered set distribution using Chen--Stein method.
Established the limit of the constant (d) as dimension increases to 3/4.
Applied concentration results for Markov chains to analyze random walk coverage.
Abstract
Let be a simple random walk on with and let be the expected cover time. We consider the set of points of that have not been visited by the walk by time for . It was shown in [MS17] that there exists such that for all the total variation distance between the law of the set and an i.i.d. sequence of Bernoulli random variables indexed by with success probability tends to as . In [MS17] the constant converges to as . 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 which converges to as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
