On cover times for 2D lattices

25Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We study the cover time Tcov 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 as n increases, This improves a result of Dembo, Peres, Rosen, and Zeitouni (2004) and makes progress towards a conjecture of Bramson and Zeitouni (2009).

Cite

CITATION STYLE

APA

Ding, J. (2012). On cover times for 2D lattices. Electronic Journal of Probability, 17, 1–18. https://doi.org/10.1214/EJP.v17-2089

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free