Report 99-018 Scenery Reconstruction in Two Dimensions with….pdfVIP

Report 99-018 Scenery Reconstruction in Two Dimensions with many Colors Matthias Lowe Heinrich Matzinger III ISSN: 1389-2355 SCENERY RECONSTRUCTION IN TWO DIMENSIONS WITH MANY COLORS MATTHIAS LOWE AND HEINRICH MATZINGER III ABSTRACT. In [6) Kesten observed that the known reconstruction methods of random sceneries seem to strongly depend on the one dimensional setting of the problem and asked whether a construction still is possible in two dimensions. In this paper we answer the above question in the affirmative under the condition that the number of colors in the scenery is large enough. 1. INTRODUCTION AND THE MAIN RESULT The following problem has its roots in ergodic theory but may also be considered interesting in its own rights. Consider a graph (V, E) and color its vertices in an arbitrary way (so we do not only concentrate on proper colorings in the strict sense that any two adjacent vertices need to have a different color). This coloring will be called a scenery on (V, E). Then we run a random walk on (V, E) of which we only know the color record (i.e. the sequence of colors it reads at the vertices) but not where it actually reads them. The question then is: Can we still say anything about how V was colored? This problem - which at first glance might seem a bit hopeless - was first investi- gated independently by Benjamini and den Hollander and Keane [5]. From here the problem splits into basically three branches: