A random walk proof of the Erdős-Taylor conjecture (Q2568554)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A random walk proof of the Erdős-Taylor conjecture |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A random walk proof of the Erdős-Taylor conjecture |
scientific article |
Statements
A random walk proof of the Erdős-Taylor conjecture (English)
0 references
5 October 2006
0 references
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.
0 references
frequent points
0 references
0.8515068292617798
0 references
0.847665011882782
0 references
0.847665011882782
0 references
0.7913258075714111
0 references
