Skip to main content
Log in

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

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10998-005-0014-8

Navigation