A random walk proof of the Erdős-Taylor conjecture
From MaRDI portal
Publication:2568554
DOI10.1007/S10998-005-0014-8zbMATH Open1098.60045arXivmath/0503108OpenAlexW2156601460WikidataQ123142992 ScholiaQ123142992MaRDI QIDQ2568554FDOQ2568554
Publication date: 5 October 2006
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0503108
Recommendations
Cited In (16)
- Title not available (Why is that?)
- Frequently visited sites of the inner boundary of simple random walk range
- Thick points of random walk and the Gaussian free field
- Thick points for planar Brownian motion and the Erdős-Taylor conjecture on random walk
- Characterisation of planar Brownian multiplicative chaos
- 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
- Multiplicative chaos of the Brownian loop soup
- Frequent points for random walks in two dimensions
- 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\)
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)
