Information recovery from observations by a random walk having jump distribution with exponential tails
Andrew Hart, Fabio Machado, Heinrich Matzinger

TL;DR
This paper introduces a new method for reconstructing scenery observed along a recurrent random walk with unbounded jumps, requiring exponential tail decay and a five-color scenery, expanding beyond previous bounded-increment approaches.
Contribution
It develops a novel scenery reconstruction approach applicable to random walks with unbounded jumps and exponential tail decay, extending the scope of previous bounded-increment methods.
Findings
Reconstruction is possible with unbounded jumps under exponential tail decay.
The method works specifically for scenery with five colors.
Previous methods required bounded increments, now extended to unbounded cases.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Statistical Methods and Inference · Bayesian Methods and Mixture Models
