Information recovery from observations by a random walk having jump distribution with exponential tails
arXiv:1110.6853
Abstract
A {\it scenery} is a coloring of the integers. Let be a recurrent random walk on the integers. Observing the scenery along the path of this random walk, one sees the color at time . The {\it scenery reconstruction problem} is concerned with recovering the scenery , given only the sequence of observations . The scenery reconstruction methods presented to date require the random walk to have bounded increments. Here, we present a new approach for random walks with unbounded increments which works when the tail of the increment distribution decays exponentially fast enough and the scenery has five colors.