Abstract
AbstractSuppose that attached to each site z ∈ ℤ is a coin with bias θ(z), and only finitely many of these coins have nonzero 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 {θ(z)}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 ℤ. This generalizes a result of Harris and Keane. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
