Frequently visited sites of the inner boundary of simple random walk range
From MaRDI portal
Publication:265646
DOI10.1016/J.SPA.2015.11.008zbMATH Open1335.60071arXiv1409.8368OpenAlexW1652335846MaRDI QIDQ265646FDOQ265646
Authors: Izumi Okada
Publication date: 4 April 2016
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Abstract: This paper considers the question: how many times does a simple random walk revisit the most frequently visited site among the inner boundary points? It is known that in , the number of visits to the most frequently visited site among all of the points of the random walk range up to time is asymptotic to , while in , it is of order . We prove that the corresponding number for the inner boundary is asymptotic to for any , where is a certain constant having a simple probabilistic expression.
Full work available at URL: https://arxiv.org/abs/1409.8368
Recommendations
Cites Work
- The escape rate of favorite sites of simple random walk and Brownian motion.
- Hausdorff dimension of cut points for Brownian motion
- A random walk proof of the Erdős-Taylor conjecture
- Title not available (Why is that?)
- Some problems concerning the structure of random walk paths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Favourite sites of simple random walk
- Thick points for planar Brownian motion and the Erdős-Taylor conjecture on random walk
- Entropy of random walk range
Cited In (5)
- Characterisation of planar Brownian multiplicative chaos
- Exceptional points of two-dimensional random walks at multiples of the cover time
- Frequent points for random walks in two dimensions
- Boundary of the range of transient 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: Frequently visited sites of the inner boundary of simple random walk range
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265646)