Abstract
LetG be an infinite connected graph with vertex setV. Ascenery onG is a map ξ :V → 0, 1 (equivalently, an assignment of zeroes and ones to the vertices ofG). LetSnn≥0 be a simple random walk onG, starting at some distinguished vertex v0. Now let ξ and η be twoknown sceneries and assume that we observe one of the two sequences ξ(Sn)n≥0 or {η(Sn)}n≥0 but we do not know which of the two sequences is observed. Can we decide, with a zero probability of error, which of the two sequences is observed? We show that ifG = Z orG = Z2, then the answer is “yes” for each fixed ξ and “almost all” η. We also give some examples of graphsG for which almost all pairs (ξ, η) are not distinguishable, and discuss some variants of this problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
