How large a disc is covered by a random walk in n steps?

From MaRDI portal
Publication:2371949



Abstract: We show that the largest disc covered by a simple random walk (SRW) on mathbbZ2 after n steps has radius n^{1/4+o(1)}, thus resolving an open problem of R'{e}v'{e}sz [Random Walk in Random and Non-Random Environments (1990) World Scientific, Teaneck, NJ]. For any fixed ell, the largest disc completely covered at least ell times by the SRW also has radius n^{1/4+o(1)}. However, the largest disc completely covered by each of ell independent simple random walks on mathbbZ2 after n steps is only of radius n1/(2+2sqrtell)+o(1). We complement this by showing that the radius of the largest disc completely covered at least a fixed fraction alpha of the maximum number of visits to any site during the first n steps of the SRW on mathbbZ2, is n(1−sqrtalpha)/4+o(1). We also show that almost surely, for infinitely many values of n it takes about n1/2+o(1) steps after step n for the SRW to reach the first previously unvisited site (and the exponent 1/2 is sharp). This resolves a problem raised by R'{e}v'{e}sz [Ann. Probab. 21 (1993) 318--328].


Consider a simple random walk (SRW) on \({\mathbb Z}^2\) starting at the origin and run for \(n\) steps. The authors ask for the largest disc covered of the SRW without specifying the center of the disc. In the paper the following four main results are given: (1) one concerning the radius of the largest disc completely covered; (2) one if the disc is required to be multiply covered; (3) one if there are \(\ell\) independent SRW; (4) one concerning the random times in which the SRW is sufficiently inside a completely covered disc. We note that these results solve some problems raised by Révész in 1990 and 1993 [\textit{P. Révész}, Random walk in random and non-random environments, World Scientific (1990; Zbl 0733.60091), \textit{N. J. Teaneck} and \textit{P. Révész}, Ann. Probab. 21, No. 1, 318--328 (1993; Zbl 0770.60034)].











This page was built for publication: How large a disc is covered by a random walk in \(n\) steps?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371949)