Frequently visited sites of the inner boundary of simple random walk range
From MaRDI portal
(Redirected from Publication:265646)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3953992 (Why is no real title available?)
- scientific article; zbMATH DE number 4024454 (Why is no real title available?)
- A random walk proof of the Erdős-Taylor conjecture
- Entropy of random walk range
- Favourite sites of simple random walk
- Hausdorff dimension of cut points for Brownian motion
- Intersections of random walks.
- Some problems concerning the structure of random walk paths
- The escape rate of favorite sites of simple random walk and Brownian motion.
- Thick points for planar Brownian motion and the Erdős-Taylor conjecture on random walk
Cited in
(7)- Characterisation of planar Brownian multiplicative chaos
- Exceptional points of two-dimensional random walks at multiples of the cover time
- Exponent for sets of frequently visited points of a simple random walk in two dimensions
- The inner boundary of random walk range
- 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)