Summary
For the simple random walk in <InlineEquation ID=IE”1”><EquationSource Format=”TEX”><![CDATA[<InlineEquation ID=IE”2”><EquationSource Format=”TEX”><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>\mathbb{Z}^2$ we study those points which are visited an unusually large number of times, and provide a new proof of the Erdős-Taylor Conjecture describing the number of visits to the most visited point.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rosen, J. A random walk proof of the Erdős-Taylor conjecture. Period Math Hung 50, 223–245 (2005). https://doi.org/10.1007/s10998-005-0014-8
Issue Date:
DOI: https://doi.org/10.1007/s10998-005-0014-8