On cover times for 2D lattices

Abstract

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).

21 pages, major revision upon previous version

References in corpus (1)

• Tightness for a family of recursion equations

Cited by in corpus (1)

• Branching Brownian motion with selection of the N right-most particles: An approximate model