Indistinguishable sceneries

Elon Lindenstrauss

doi:10.1002/(SICI)1098-2418(1999010)14:1<71::AID-RSA4>3.0.CO;2-9

Indistinguishable sceneries

Elon Lindenstrauss^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

24 Scopus citations

Abstract

In this paper we give a counterexample to a conjecture mentioned in Benjamini 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.

Original language	English
Pages (from-to)	71-86
Number of pages	16
Journal	Random Structures and Algorithms
Volume	14
Issue number	1
DOIs	https://doi.org/10.1002/(SICI)1098-2418(1999010)14:1<71::AID-RSA4>3.0.CO;2-9
State	Published - Jan 1999

Keywords

Distinguishability
Mutually singular measures
Random walk
Sceneries

Access to Document

10.1002/(SICI)1098-2418(1999010)14:1<71::AID-RSA4>3.0.CO;2-9

Cite this

@article{b40e7fd0be764f62a18f6b75cee62cd5,

title = "Indistinguishable sceneries",

abstract = "In this paper we give a counterexample to a conjecture mentioned in Benjamini 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.",

keywords = "Distinguishability, Mutually singular measures, Random walk, Sceneries",

author = "Elon Lindenstrauss",

year = "1999",

month = jan,

doi = "10.1002/(SICI)1098-2418(1999010)14:1<71::AID-RSA4>3.0.CO;2-9",

language = "אנגלית",

volume = "14",

pages = "71--86",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "1",

}

TY - JOUR

T1 - Indistinguishable sceneries

AU - Lindenstrauss, Elon

PY - 1999/1

Y1 - 1999/1

N2 - In this paper we give a counterexample to a conjecture mentioned in Benjamini 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.

AB - In this paper we give a counterexample to a conjecture mentioned in Benjamini 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.

KW - Distinguishability

KW - Mutually singular measures

KW - Random walk

KW - Sceneries

UR - https://www.scopus.com/pages/publications/0033475651

U2 - 10.1002/(SICI)1098-2418(1999010)14:1<71::AID-RSA4>3.0.CO;2-9

DO - 10.1002/(SICI)1098-2418(1999010)14:1<71::AID-RSA4>3.0.CO;2-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0033475651

SN - 1042-9832

VL - 14

SP - 71

EP - 86

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 1

ER -

Indistinguishable sceneries

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this