Information recovery from observations by a random walk having jump distribution with exponential tails

preprint2011arXivOpen access

Abstract

A {\it scenery} is a coloring ξξ of the integers. Let {St}t≥0\{S_t\}_{t\geq 0} be a recurrent random walk on the integers. Observing the scenery ξξ along the path of this random walk, one sees the color χt:=ξ(St)χ_t:=ξ(S_t) at time tt. The {\it scenery reconstruction problem} is concerned with recovering the scenery ξξ, given only the sequence of observations χ:=(χt)t≥0χ:=(χ_t)_{t\geq 0}. 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.