Home | Contents | Submissions, editors, etc. | Login | Search | ECP
 Electronic Journal of Probability > Vol. 12 (2007) > Paper 22 open journal systems 


Detecting a local perturbation in a continuous scenery

Heinrich Matzinger, Georgia Institute of Technology
Serguei Popov, Universidade de São Paulo


Abstract
A continuous one-dimensional scenery is a double-infinite sequence of points (thought of as locations of bells) in R. Assume that a scenery X is observed along the path of a Brownian motion in the following way: when the Brownian motion encounters a bell different from the last one visited, we hear a ring. The trajectory of the Brownian motion is unknown, whilst the scenery X is known except in some finite interval. We prove that given only the sequence of times of rings, we can a.s. reconstruct the scenery X entirely. For this we take the scenery X to be a local perturbation of a Poisson scenery X'. We present an explicit reconstruction algorithm. This problem is the continuous analog of the "detection of a defect in a discrete scenery". Many of the essential techniques used with discrete sceneries do not work with continuous sceneries.


Full text: PDF

Pages: 637-660

Published on: May 13, 2007


Bibliography
  1. I. Benjamini, H. Kesten. Distinguishing sceneries by observing the scenery along a random walk path. J. Anal. Math.  69 (1996), 97-135. Math Review 98f:60134
  2. A.N. Borodin, P. Salminen. Handbook of Brownian motion - Facts and Formulae. Birkhäuser Verlag, Basel-Boston-Berlin, 2002. Math Review 2003g:60001
  3. K. Burdzy. Some path properties of iterated Brownian motion. Seminar on Stochastic Processes, 1992 (Seattle, WA, 1992), Progr. Probab. 33 (1993), 67-87, Birkhäuser Boston. Math Review 95c:60075
  4. C.D. Howard. Distinguishing certain random sceneries on Z via random walks. Statist. Probab. Lett. 34 (1997), no. 2, 123-132. Math Review 98h:60106
  5. H. Kesten. Distinguishing and reconstructing sceneries from observations along random walk paths. Microsurveys in discrete probability (Princeton, NJ, 1997), 75--83, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 41, Amer. Math. Soc., Providence, RI, 1998. Math Review 99i:60141
  6. I. Karatzas, S.E. Shreve. Brownian Motion and Stochastic Calculus. Springer Verlag, New York, 1991. Math Review 92h:60127
  7. A.I. Kostrikin. Introduction to Algebra. Springer Verlag, New York - Berlin, 1982. Math Review 83f:00003
  8. E. Lindenstrauss. Indistinguishable sceneries. Random Structures Algorithms 14 (1999), no. 1, 71-86. Math Review 99m:60106
  9. H. Matzinger. Reconstructing a three-color scenery by observing it along a simple random walk path. Random Structures Algorithms 15 (1999), no. 2, 196-207. Math Review 2000m:60048
  10. H. Matzinger. Reconstructing a 2-color scenery by observing it along a simple random walk path. Ann. Appl. Probab. 15 (2005), 778-819. Math Review 2005m:60243
  11. H. Matzinger, S.W.W. Rolles. Retrieving random media. Probab. Theory Related Fields 136 (2006), no. 3, 469-507. Math review MR2257132
  12. A. Shiryaev. Probability (2nd ed.). Springer Verlag, New York, 1996. Math Review 97c:60003
















Research
Support Tool
Capture Cite
View Metadata
Printer Friendly
Context
Author Address
Action
Email Author
Email Others


Home | Contents | Submissions, editors, etc. | Login | Search | ECP

Electronic Journal of Probability. ISSN: 1083-6489