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

Abstract

A scenery is a coloring of the integers. Let \St\t≥ 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) at time t. The scenery reconstruction problem is concerned with recovering the scenery , given only the sequence of observations :=(t)t≥ 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…