Reconstruction of a multidimensional scenery with a branching random walk

From MaRDI portal
Publication:2013565

DOI10.1214/16-AAP1183zbMATH Open1370.60146arXiv1511.00973OpenAlexW2222755894MaRDI QIDQ2013565FDOQ2013565


Authors: Heinrich Matzinger, Angelica Pachón, S. Popov Edit this on Wikidata


Publication date: 8 August 2017

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: In this paper 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 is seeing. We show that we can a.s. reconstruct the scenery up to equivalence from the color record of all the particles. For this 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 [22] where the particles needed to see at each time a window around their current position. In [11] the reconstruction is done for d = 2 with only one particle instead of a branching random walk, but millions of colors are necessary.


Full work available at URL: https://arxiv.org/abs/1511.00973




Recommendations





Cited In (5)





This page was built for publication: Reconstruction of a multidimensional scenery with a branching random walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013565)