arXiv Analytics

Sign in

arXiv:1110.3367 [math.PR]AbstractReferencesReviewsResources

On cover times for 2D lattices

Jian Ding

Published 2011-10-15, updated 2012-06-05Version 2

We study the cover time $\tau_{\mathrm{cov}}$ by (continuous-time) random walk on the 2D box of side length $n$ with wired boundary or on the 2D torus, and show that in both cases with probability approaching 1 as $n$ increases, $\sqrt{\tau_{\mathrm{cov}}}=\sqrt{2n^2}[\sqrt{2/\pi} \log n + O(\log\log n)]$. This improves a result of Dembo, Peres, Rosen, and Zeitouni (2004) and makes progress towards a conjecture of Bramson and Zeitouni (2009).

Comments: 21 pages, major revision upon previous version
Categories: math.PR
Subjects: 60J10, 60G60, 60G15
Related articles: Most relevant | Search more
arXiv:1004.4371 [math.PR] (Published 2010-04-25, updated 2011-10-07)
Cover times, blanket times, and majorizing measures
arXiv:1104.0434 [math.PR] (Published 2011-04-03)
A sharp estimate for cover times on binary trees
arXiv:2102.12356 [math.PR] (Published 2021-02-24)
The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational