A random walk proof of the Erdős-Taylor conjecture
From MaRDI portal
Publication:2568554
Abstract: For the simple random walk in Z^2 we study those points which are visited an unusually large number of times, and provide a new proof of the Erdos-Taylor conjecture describing the number of visits to the most visited point.
Recommendations
Cited in
(17)- Frequently visited sites of the inner boundary of simple random walk range
- Thick points of random walk and the Gaussian free field
- Characterisation of planar Brownian multiplicative chaos
- Thick points for planar Brownian motion and the Erdős-Taylor conjecture on random walk
- How large a disc is covered by a random walk in \(n\) steps?
- Generalized range of slow random walks on trees
- Hilbert’s Irreducibility Theorem via Random Walks
- Tightness for thick points in two dimensions
- Exceptional points of two-dimensional random walks at multiples of the cover time
- Critical Brownian multiplicative chaos
- Exponent for sets of frequently visited points of a simple random walk in two dimensions
- Frequent points for random walks in two dimensions
- Multiplicative chaos of the Brownian loop soup
- On three conjectures by K. E. Shuler
- Geometric structures of late points of a two-dimensional simple random walk
- Exponents for the number of pairs of \(\alpha \)-favorite points of a simple random walk in \(\mathbb{Z}^2\)
- A multivariate extension of the Erdős-Taylor theorem
This page was built for publication: A random walk proof of the Erdős-Taylor conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568554)
