A random walk proof of the Erdős-Taylor conjecture

From MaRDI portal
Publication:2568554



Abstract: For the simple random walk in Z^2 we study those points which are visited an unusually large number of times, and provide a new proof of the Erdos-Taylor conjecture describing the number of visits to the most visited point.


In \textit{A. Dembo, Y. Peres, J. Rosen} and \textit{O. Zeitouni} [Acta. Math. 186, No.~2, 239--270 (2001; Zbl 1008.60063)], the Erdős-Taylor conjecture, concerning the asymptotics of the number of visits to the most frequently visited point in the first \(n\) steps of the simple planar random walk. Their proof was by deduction from a related result for planar Brownian motion. In this paper, the conjecture, together with some refinements, is proved by purely random walk arguments.











This page was built for publication: A random walk proof of the Erdős-Taylor conjecture

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