×

Scenery reconstruction in two dimensions with many colors. (English) Zbl 1018.60100

The two-dimensional scenery is a function \(\xi :Z^2\to Z.\) For \(D\subset Z^2, \;\;\xi :D\to Z\) is called a piece of scenery. If the range of \(\xi\) contains exactly \(m\) elements, then say that \(\xi\) has \(m\) colors. \(\xi\) and \(\overline{\xi}\) are equivalent if they can be obtained from each other by translation and reflection on the coordinate axes. In the paper \(\xi\) is the result from an unbiased i.i.d. random process with \(m\) colors; that is \(\xi(v)\) are i.i.d. for all \(v\in Z^2\) and \(P(\xi(0)=i)=1/m\) for all colors \(i\in \{0,1,...,m-1\}.\) Let \((S_k)_{k\in N}\) be a simple, symmetric random walk in two dimensions starting at the origin. The main result of the paper states that if \(m\) is large enough, the color record of \((S_k)\), that is \(\chi:=(\xi(S_k))_{k\in N},\) contains enough information to reconstruct \(\xi\) almost surely up to equivalence. Also a well-defined algorithm that gives the scenery with probability larger than \(1/2\) is presented.

MSC:

60K37 Processes in random environments
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] BENJAMINI, I. and KESTEN, H. (1996). Distinguishing sceneries by observing the sceneries along a random walk path. J. Anal. Math. 69 97-135. · Zbl 0868.60059 · doi:10.1007/BF02787104
[2] DEN HOLLANDER, W. Th. F. and KEANE, M. (1986). Ergodic properties of color records. Phy s. A 138 183-193. · Zbl 0666.60037 · doi:10.1016/0378-4371(86)90179-2
[3] DOWNHAM, D. and FOTOPOLOUS, S. (1988). The transient behaviour of the simple random walk in the plane. J. Appl. Probab. 25 58-69. JSTOR: · Zbl 0644.60065 · doi:10.2307/3214233
[4] DVORETZKY, A. and ERDÖS, P. (1951). Some problems on random walks in space. Proc. Second Berkeley Sy mp. Math. Statist. Probab. 353-367. Univ. California Press, Berkeley. · Zbl 0044.14001
[5] ERDÖS, P. and TAy LOR, S. J. (1960). Some problems concerning the structure of random walk paths. Acta Math. Acad. Sci. Hungar. 11 137-162. · Zbl 0091.13303 · doi:10.1007/BF02020631
[6] HOWARD, C. D. (1996). Detecting defects in periodic scenery by random walks in Z. Random Structures Algorithms 8 59-74. · Zbl 0840.60064 · doi:10.1002/(SICI)1098-2418(199601)8:1<59::AID-RSA3>3.0.CO;2-Q
[7] KESTEN, H. (1998). Distinguishing and reconstructing sceneries from observations from random walk paths. In Microsurvey s in Discrete Probability (D. Aldous and J. Propp, eds.) 75-83. Amer. Math. Soc., Providence, RI. · Zbl 0908.60069
[8] LINDENSTRAUSS, E. (1999). Indistinguishable sceneries. Random Structures Algorithms 14 71-86. · Zbl 0963.60042 · doi:10.1002/(SICI)1098-2418(1999010)14:1<71::AID-RSA4>3.0.CO;2-9
[9] MATZINGER, H. (1997). Reconstructing a 3-color scenery by observing it along a simple random walk. Random Structures Algorithms 15 196-207. · Zbl 0939.60029 · doi:10.1002/(SICI)1098-2418(199909)15:2<196::AID-RSA5>3.0.CO;2-#
[10] MATZINGER, H. (1999). Reconstruction of a one dimensional scenery seen along the path of a random walk with holding. Ph.D. thesis, Cornell Univ.
[11] REVESZ, P. (1990). Estimates on the largest disc covered by a random walk. Ann. Probab. 18 1784-1789. · Zbl 0721.60071 · doi:10.1214/aop/1176990648
[12] SPITZER, F. (1964). Principles of Random Walk. Van Nostrand, London. · Zbl 0119.34304
[13] TALAGRAND, M. (1996). A new look at independence. Ann. Probab. 24 1-34. · Zbl 0858.60019 · doi:10.1214/aop/1042644705
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.