Identifying several biased coins encountered by a hidden random walk

Simple item page
dc.creatorLevin, David A.
dc.creatorPeres, Yuval
dc.date2003-04-22
dc.date2004-02-09
dc.date.accessioned2026-07-07T08:06:07Z
dc.date.available2026-07-07T08:06:07Z
dc.descriptionSuppose 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.
dc.description24 Pages, 1 figure. Minor corrections, references added. To appear in Random Structures and Algorithms
dc.identifierhttps://arxiv.org/abs/math/0304311
dc.identifierhttp://arxiv.org/abs/math/0304311
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130496
dc.subjectProbability
dc.subjectStatistics Theory
dc.subject60J10, 62M05
dc.titleIdentifying several biased coins encountered by a hidden random walk
dc.typetext

Files

Collections

arXiv