Scenery reconstruction for random walk on random scenery systems

Consider a simple random walk on ℤ with a random coloring of ℤ. Look at the sequence of the first N steps taken in the random walk, together with the colors of the visited locations. We call this the record. From the record one can deduce the coloring of the interval in ℤ that was visited, which is of size approximately √(N) . This is called scenery reconstruction. Now suppose that an adversary may change δN entries in the record that was obtained. What can we deduce from the record about the scenery now? In this paper we show that it is likely that we can still reconstruct a large part of the scenery. More precisely, we show that for any θ <0.5, p > 0 and ∊ > 0, there are N 0 and δ 0 such that if N > N 0 and δ < δ 0 , then with probability > 1 − p the walk is such that we can reconstruct the coloring of > N θ integers in the scenery, up to having a number of suggested reconstructions that is less than 2 ∊s , where s is the number of integers whose color we reconstruct.