A random walk proof of the Erdős-Taylor conjecture
Tóm tắt
For the simple random walk in ]]>\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.