Localization for random walks among random obstacles in a single Euclidean ball

From MaRDI portal
Publication:2174639



Abstract: Place an obstacle with probability 1−p independently at each vertex of mathbbZd, and run a simple random walk until hitting one of the obstacles. For dgeq2 and p strictly above the critical threshold for site percolation, we condition on the environment where the origin is contained in an infinite connected component free of obstacles, and we show that for environments with probability tending to one as noinfty there exists a unique discrete Euclidean ball of volume dlog1/pn asymptotically such that the following holds: conditioned on survival up to time n we have that at any time tin[o(n),n] with probability tending to one the simple random walk is in this ball. This work relies on and substantially improves a previous result of the authors on localization in a region of volume poly-logarithmic in n for the same problem.




Cites work









This page was built for publication: Localization for random walks among random obstacles in a single Euclidean ball

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