The Annals of Applied Probability

Reconstruction of a multidimensional scenery with a branching random walk

Heinrich Matzinger, Angelica Pachon, and Serguei Popov

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We consider a $d$-dimensional scenery seen along a simple symmetric branching random walk, where at each time each particle gives the color record it observes. We show that up to equivalence the scenery can be reconstructed a.s. from the color record of all particles. To do so, we assume that the scenery has at least $2d+1$ colors which are i.i.d. with uniform probability. This is an improvement in comparison to Popov and Pachon [Stochastics 83 (2011) 107–116], where at each time the particles needed to see a window around their current position, and in Löwe and Matzinger [Ann. Appl. Probab. 12 (2002) 1322–1347], where the reconstruction is done for $d=2$ with a single particle instead of a branching random walk, but millions of colors are necessary.

Article information

Source
Ann. Appl. Probab., Volume 27, Number 2 (2017), 651-685.

Dates
Received: March 2014
Revised: June 2015
First available in Project Euclid: 26 May 2017

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1495764363

Digital Object Identifier
doi:10.1214/16-AAP1183

Mathematical Reviews number (MathSciNet)
MR3655850

Zentralblatt MATH identifier
1370.60146

Subjects
Primary: 60J05: Discrete-time Markov processes on general state spaces 60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

Keywords
Random walk branching random walk reconstruction algorithm

Citation

Matzinger, Heinrich; Pachon, Angelica; Popov, Serguei. Reconstruction of a multidimensional scenery with a branching random walk. Ann. Appl. Probab. 27 (2017), no. 2, 651--685. doi:10.1214/16-AAP1183. https://projecteuclid.org/euclid.aoap/1495764363


Export citation

References

  • [1] Benjamini, I. and Kesten, H. (1996). Distinguishing sceneries by observing the scenery along a random walk path. J. Anal. Math. 69 97–135.
  • [2] den Hollander, F. and Steif, J. E. (1997). Mixing properties of the generalized $T,T^{-1}$-process. J. Anal. Math. 72 165–202.
  • [3] Howard, C. D. (1996). Detecting defects in periodic scenery by random walks on $\mathbf{Z}$. Random Structures Algorithms 8 59–74.
  • [4] Howard, C. D. (1996). Orthogonality of measures induced by random walks with scenery. Combin. Probab. Comput. 5 247–256.
  • [5] Howard, C. D. (1997). Distinguishing certain random sceneries on $\textbf{Z}$ via random walks. Statist. Probab. Lett. 34 123–132.
  • [6] Kalikow, S. A. (1982). $T,\,T^{-1}$ transformation is not loosely Bernoulli. Ann. of Math. (2) 115 393–409.
  • [7] Kesten, H. (1996). Detecting a single defect in a scenery by observing the scenery along a random walk path. In Itô’s Stochastic Calculus and Probability Theory 171–183. Springer, Tokyo.
  • [8] Kesten, H. (1998). Distinguishing and reconstructing sceneries from observations along random walk paths. In Microsurveys in Discrete Probability (Princeton, NJ, 1997). DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 41 75–83. Amer. Math. Soc., Providence, RI.
  • [9] Lember, J. and Matzinger, H. (2008). Information recovery from a randomly mixed up message-text. Electron. J. Probab. 13 396–466.
  • [10] Lindenstrauss, E. (1999). Indistinguishable sceneries. Random Structures Algorithms 14 71–86.
  • [11] Löwe, M., Matzinger, H. and Merkl, F. (2004). Reconstructing a multicolor random scenery seen along a random walk path with bounded jumps. Electron. J. Probab. 9 436–507 (electronic).
  • [12] Löwe, M. and Matzinger, H. III (2002). Scenery reconstruction in two dimensions with many colors. Ann. Appl. Probab. 12 1322–1347.
  • [13] Matzinger, H. (1999). Reconstructing a three-color scenery by observing it along a simple random walk path. Random Structures Algorithms 15 196–207.
  • [14] Matzinger, H. (2005). Reconstructing a two-color scenery by observing it along a simple random walk path. Ann. Appl. Probab. 15 778–819.
  • [15] Matzinger, H. and Pachon, A. (2011). DNA approach to scenery reconstruction. Stochastic Process. Appl. 121 2455–2473.
  • [16] Matzinger, H. and Popov, S. (2007). Detecting a local perturbation in a continuous scenery. Electron. J. Probab. 12 637–660.
  • [17] Matzinger, H. and Rolles, S. W. W. (2003). Reconstructing a random scenery observed with random errors along a random walk path. Probab. Theory Related Fields 125 539–577.
  • [18] Matzinger, H. and Rolles, S. W. W. (2003). Reconstructing a piece of scenery with polynomially many observations. Stochastic Process. Appl. 107 289–300.
  • [19] Matzinger, H. and Rolles, S. W. W. (2006). Finding blocks and other patterns in a random coloring of $\mathbb{Z}$. Random Structures Algorithms 28 37–75.
  • [20] Ornstein, D. (1971). A Kolmogorov automorphism that is not a Bernoulli shift. Matematika 15 131–150. (In Russian.)
  • [21] Popov, S. and Pachon, A. (2011). Scenery reconstruction with branching random walk. Stochastics 83 107–116.
  • [22] Weiss, B. (1972). The isomorphism problem in ergodic theory. Bull. Amer. Math. Soc. 78 668–684.