Identifying several biased coins encountered by a hidden random walk

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Suppose that attached to each site z in Z is a coin with bias theta(z), and only finitely many of these coins have non-zero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its current position. Then we can determine the biases {theta(z) : z in Z}, using only the outcomes of these coin tosses and no information about the path of the random walker, up to a shift and reflection of Z. This generalizes a result of Harris and Keane.
24 Pages, 1 figure. Minor corrections, references added. To appear in Random Structures and Algorithms

Keywords

Probability, Statistics Theory, 60J10, 62M05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/130496

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0304311
 http://arxiv.org/abs/math/0304311

Collections

arXiv