Detecting the trail of a random Walker in a random scenery
From MaRDI portal
(Redirected from Publication:388980)
Abstract: Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins. For which walks and dimensions can the resulting scenery be distinguished from the original scenery? We find the answer for simple random walk, where it does not depend on dimension, and for walks with a nonzero mean, where a transition occurs between dimensions three and four. We also answer this question for other types of graphs and walks, and raise several new questions.
Recommendations
- scientific article; zbMATH DE number 850333
- On random walks in random scenery
- Marche aléatoire dynamique dans une scène aléatoire
- Distinguishing sceneries by observing the scenery along a random walk path
- Detecting periodicity from the trajectory of a random walk in random environment
- Random walks in random sceneries and related models
- A note on random walk in random scenery
- scientific article; zbMATH DE number 956696
- Random walk in random scenery: A survey of some recent results
Cited in
(7)- Bad configurations for random walk in random scenery and related subshifts
- Distinguishing sceneries by observing the scenery along a random walk path
- Orthogonality of Measures Induced by Random Walks with Scenery
- On random walks in random scenery
- Recognition of times a walker is close to the origin
- Limit theorems for additive functionals of random walks in random scenery
- Identifying several biased coins encountered by a hidden random walk
This page was built for publication: Detecting the trail of a random Walker in a random scenery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388980)
