No more than three favorite sites for simple random walk
From MaRDI portal
Publication:1872196
Abstract: We prove that, with probability one, eventually there are no more than three favourite (i.e. most visited) sites of simple random walk. This partially answers a relatively long standing question of Pal Erdos and Pal Revesz.
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?)
- scientific article; zbMATH DE number 47625 (Why is no real title available?)
- scientific article; zbMATH DE number 168143 (Why is no real title available?)
- 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\)
- 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
Cited in
(17)- scientific article; zbMATH DE number 3953992 (Why is no real title available?)
- On the local time of random walk on the 2-dimensional comb
- Isomorphism theorems for Markov chains.
- A limit law for the most favorite point of simple random walk on a regular tree
- Random walk local time approximated by a Brownian sheet combined with an independent Brownian motion
- Favourite sites of simple random walk
- Favorite sites of a persistent random walk
- The escape rate of favorite sites of simple random walk and Brownian motion.
- The rate of escape of the most visited site of Brownian motion
- Favorite sites of randomly biased walks on a supercritical Galton-Watson tree
- Three favorite sites occurs infinitely often for one-dimensional simple random walk
- About the distance between random walkers on some graphs
- On uniform closeness of local times of Markov chains and i.i.d. sequences
- On the most visited sites of symmetric Markov processes.
- scientific article; zbMATH DE number 168143 (Why is no real title available?)
- Random walks on comb-type subsets of \(\mathbb{Z}^2\)
- On biased random walks, corrupted intervals, and learning under adversarial design
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)