Abstract
Benjamini asked whether the scenery reconstruction methods of Matzinger (see e.g. [21], [22], [20]) can be done in polynomial time. In this article, we give the following answer for a 2-color scenery and simple random walk with holding: We prove that a piece of the scenery of length of the order 3n around the origin can be reconstructed – up to a reflection and a small translation – with high probability from the first 2 · 310 αn observations with a constant α > 0 independent of n. Thus, the number of observations needed is polynomial in the length of the piece of scenery which we reconstruct. The probability that the reconstruction fails tends to 0 as n→∞.
In contrast to [21], [22], and [20], the proofs in this article are all constructive. Our reconstruction algorithm is an algorithm in the sense of computer science. This is the first article which shows that the scenery reconstruction is also possible in the 2-color case with holding. The case with holding is much more difficult than [22] and requires completely different methods.
Article PDF
Similar content being viewed by others
References
Benjamini, I., Kesten, H.: Distinguishing sceneries by observing the scenery along a random walk path. J. Anal. Math. 69, 97–135 (1996)
Burdzy, K.: Some path properties of iterated Brownian motion. In: Seminar on Stochastic Processes, 1992 (Seattle, WA, 1992), volume 33 of Progr. Probab., pages 67–87. Birkhäuser Boston, Boston, MA, 1993
den Hollander, F., Steif, J.E.: Mixing properties of the generalized T,T −1-process. J. Anal. Math. 72, 165–202 (1997)
den Hollander, W.Th.F.: Mixing properties for random walk in random scenery. Ann. Probab. 16 (4), 1788–1802 (1988)
Durrett, R.: Probability: Theory and Examples. Duxbury Press, Second edition, 1996
Heicklen, D., Hoffman, C., Rudolph, D.J.: Entropy and dyadic equivalence of random walks on a random scenery. Adv. Math. 156 (2), 157–179 (2000)
Hoffman, C.: The scenery factor of the [T,T −1] transformation is not loosely Bernoulli. Proc. Amer. Math. Soc. 131 (12), 3731–3735, (electronic), (2003)
Howard, C.D.: Detecting defects in periodic scenery by random walks on ℤ. Random Structures Algorithms 8 (1), 59–74 (1996)
Howard, C.D.: Orthogonality of measures induced by random walks with scenery. Combin. Probab. Comput. 5 (3), 247–256 (1996)
Howard, C.D.: Distinguishing certain random sceneries on ℤ via random walks. Statist. Probab. Lett. 34 (2), 123–132 (1997)
Kalikow, S.A.: T, T −1 transformation is not loosely Bernoulli. Ann. of Math. (2) 115 (2), 393–409 (1982)
Keane, M., den Hollander, W.Th.F.: Ergodic properties of color records. Phys. A 138 (1-2), 183–193 (1986)
Kesten, H.: Detecting a single defect in a scenery by observing the scenery along a random walk path. In: Itô's stochastic calculus and probability theory, Springer, Tokyo, 1996, pp. 171–183
Kesten, H.: Distinguishing and reconstructing sceneries from observations along random walk paths. In: Microsurveys in discrete probability (Princeton, NJ, 1997), Amer. Math. Soc., Providence, RI, 1998, pp. 75–83
Levin, D.A., Pemantle, R., Peres, Y.: A phase transition in random coin tossing. Ann. Probab. 29 (4), 1637–1669 (2001)
Levin, D.A., Peres, Y.: Identifying several biased coins encountered by a hidden random walk. Random Structures Algorithms 25 (1), 91–114 (2004)
Lindenstrauss, E.: Indistinguishable sceneries. Random Structures Algorithms 14 (1), 71–86 (1999)
Löwe, M., Matzinger, H.: Scenery reconstruction in two dimensions with many colors. Ann. Appl. Probab. 12 (4), 1322–1347 (2002)
Löwe, M., Matzinger, H.: Reconstruction of sceneries with correlated colors. Stochastic Processes and their Applications 105 (2), 175–210 (2003)
Löwe, M., Matzinger, H., Merkl, F.: Reconstructing a multicolor random scenery seen along a random walk path with bounded jumps. Electronic Journal of Probability 9 (15), 436–507 (2004)
Matzinger, H.: Reconstructing a three-color scenery by observing it along a simple random walk path. Random Structures Algorithms 15 (2), 196–207 (1999)
Matzinger, H.: Reconstructing a two-color scenery by observing it along a simple random walk path. Ann. Appl. Probab. 15 (1B), 778–819 (2005)
Matzinger, H., Rolles, S.W.W.: Finding blocks and other patterns in a random coloring of ℤ. Accepted for publication in Random Structures Algorithms, (2005)
Matzinger, H., Rolles, S.W.W.: Reconstructing a random scenery observed with random errors along a random walk path. Probab. Theory Related Fields 125(4), 539–577 (2003)
Rolles, S.W.W.: Random walks in stochastic surroundings. PhD thesis, University of Amsterdam, 2002
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Matzinger, H., Rolles, S. Retrieving random media. Probab. Theory Relat. Fields 136, 469–507 (2006). https://doi.org/10.1007/s00440-005-0489-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00440-005-0489-5