Detecting the trail of a random Walker in a random scenery

From MaRDI portal
Publication:388980

DOI10.1214/EJP.V18-2367zbMATH Open1290.60050arXiv1210.0314MaRDI QIDQ388980FDOQ388980


Authors: Noam Berger, Yuval Peres Edit this on Wikidata


Publication date: 17 January 2014

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins. For which walks and dimensions can the resulting scenery be distinguished from the original scenery? We find the answer for simple random walk, where it does not depend on dimension, and for walks with a nonzero mean, where a transition occurs between dimensions three and four. We also answer this question for other types of graphs and walks, and raise several new questions.


Full work available at URL: https://arxiv.org/abs/1210.0314




Recommendations





Cited In (7)





This page was built for publication: Detecting the trail of a random Walker in a random scenery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388980)