Abstract
Let {¿(n)}n¿Z be a three-color random scenery, i.e., a random coloration of Z in three colors, such that the colors of the different points in N are i.i.d. Let {S(n)}n¿N be a symmetric random walk starting at 0. Our main result shows that a.s., ¿°S (the composition of ¿ and S) determines ¿ up to translation and reflection. In other words, by observing the scenery along the random walk path S, we can a.s. reconstruct ¿ up to translation and reflection. This result allows us to give a positive answer to the question of H. Kesten of whether one can a.s. detect a single defect in a three-color random scenery by observing it only along a random walk path.
| Original language | English |
|---|---|
| Pages (from-to) | 196-207 |
| Number of pages | 12 |
| Journal | Random Structures and Algorithms |
| Volume | 15 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1999 |
Fingerprint
Dive into the research topics of 'Reconstructing a three-color scenery by observing it along a simple random walk path'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver