No more than three favorite sites for simple random walk
Consider a simple symmetric random walk on the integers. The site \(x\) is a favorite site of the random walk at time \(n\) if the number of visits to \(x\) before time \(n\) is larger than or equal to the number of visits to any other site \(y\). It is obvious that for infinitely many times \(n\), there is exactly one favorite site of the random walk. It is also easy to verify that for infinitely many times \(n\), there are exactly two favorite sites of the random walk. A famous question of Erdős and Revesz is the following: Is the number of favorite sites almost surely for infinitely many times, larger than or equal to 3, 4, 5, \dots ? The paper gives a partial answer to this question, by showing that with probability 1, there are at most finitely many times when there are 4 or more favorite sites of the random walk. Let \(f(r)\) be the (possibly infinite) number of steps, when the currently occupied site is one of the \(r\) actual favorites. The author shows that \(f(4)\) has finite expectation, which implies of course that \(f(4)\) is almost surely finite. The proof uses the Ray-Knight representation of the local time process of the random walk, stopped at inverse local times, to relate \(f(4)\) to a critical Galton-Watson process with geometric offspring distribution. It can be deduced from the proof that in contrast to \(f(4)\), \(f(3)\) has infinite expectation. The (open) conjecture is that \(f(3)\) is finite, almost surely, too.
- A central limit theorem for a one-dimensional polymer measure
- An iterated logarithm law for local time
- Favourite sites, favourite values and jump sizes for random walk and Brownian motion
- Generalized Ray-Knight theory and limit theorems for self-interacting random walks on \(\mathbb{Z}^ 1\)
- scientific article; zbMATH DE number 3953992 (Why is no real title available?)
- scientific article; zbMATH DE number 4024454 (Why is no real title available?)
- scientific article; zbMATH DE number 47625 (Why is no real title available?)
- scientific article; zbMATH DE number 168143 (Why is no real title available?)
- Large favourite sites of simple random walk and the Wiener process
- On the most visited sites by a symmetric stable process
- Probability with Martingales
- Random Walks and A Sojourn Density Process of Brownian Motion
- Sojourn times of diffusion processes
- The ``true self-avoiding walk with bond repulsion on \(\mathbb{Z}\): Limit theorems
- The most visited site of Brownian motion and simple random walk
- The most visited sites of symmetric stable processes
- Tied Favourite Edges for Simple Random Walk
- On uniform closeness of local times of Markov chains and i.i.d. sequences
- Favorite sites of randomly biased walks on a supercritical Galton-Watson tree
- Three favorite sites occurs infinitely often for one-dimensional simple random walk
- The escape rate of favorite sites of simple random walk and Brownian motion.
- Favorite sites of a persistent random walk
- On biased random walks, corrupted intervals, and learning under adversarial design
- Random walks on comb-type subsets of \(\mathbb{Z}^2\)
- On the most visited sites of symmetric Markov processes.
- Isomorphism theorems for Markov chains.
- scientific article; zbMATH DE number 3953992 (Why is no real title available?)
- scientific article; zbMATH DE number 168143 (Why is no real title available?)
- Tied Favourite Edges for Simple Random Walk
- On the local time of random walk on the 2-dimensional comb
- Favourite sites of simple random walk
- A limit law for the most favorite point of simple random walk on a regular tree
- The rate of escape of the most visited site of Brownian motion
- About the distance between random walkers on some graphs
- Mini-workshop: Geometry of random fields and random walk clusters: new horizons. Abstracts from the mini-workshop held December 8--13, 2024
- Three favorite edges occurs infinitely often for one-dimensional simple random walk
- Favorite sites for simple random walk in two and more dimensions
- The asymptotic behavior of rarely visited edges of the simple random walk
- Random walk local time approximated by a Brownian sheet combined with an independent Brownian motion
This page was built for publication: No more than three favorite sites for simple random walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872196)
