Abstract
We study the problem of scenery reconstruction in arbitrary dimension using observations registered in boxes of size k (for k fixed), seen along a branching random walk. We prove that, using a large enough k for almost all the realizations of the branching random walk, almost all sceneries can be reconstructed up to equivalence.
Original language | English |
---|---|
Pages (from-to) | 107-116 |
Number of pages | 10 |
Journal | Stochastics |
Volume | 83 |
Issue number | 2 |
DOIs | |
Publication status | Published - 6 Jun 2011 |
Externally published | Yes |
Keywords
- Branching processes
- Branching random walk
- Random walk