论文信息 - Indistinguishable Sceneries

Indistinguishable Sceneries

In this paper we give a counterexample to a conjecture mentioned in Benw Ž .x jamini and Kesten J. d’Anal. Math., 69, 97]135 1996 about distinguishing sceneries by observing them along a simple random walk, giving an explicit construction of 2/0 sceneries that are all pairwise indistinguishable. Q 1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 71]86, 1999

Elon Lindenstrauss

[1] Harry Kesten,et al. Distinguishing and reconstructing sceneries from observations along random walk paths , 1997, Microsurveys in Discrete Probability.

[2] C. Douglas Howard. Distinguishing certain random sceneries on ##Z## via random walks , 1997 .

[3] Harry Kesten,et al. Distinguishing sceneries by observing the scenery along a random walk path , 1996 .

[4] C. Douglas Howard. Detecting defects in periodic scenery by random walks on Z , 1996, Random Struct. Algorithms.

[5] Harry Kesten,et al. Detecting a single defect in a scenery by observing the scenery along a random walk path , 1996 .