Abstract: | Suppose 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 |