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

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.