Localization for random walks among random obstacles in a single Euclidean ball
arXiv:1807.08168
Abstract
Place an obstacle with probability independently at each vertex of , and run a simple random walk until hitting one of the obstacles. For and 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 there exists a unique discrete Euclidean ball of volume asymptotically such that the following holds: conditioned on survival up to time we have that at any time 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 for the same problem.
arXiv comment59 pages, 6 figures. Version 2 contains minor revisions
References in corpus (5)
- Faber-Krahn inequalities in sharp quantitative form
- Geometric characterization of intermittency in the parabolic Anderson model
- A two cities theorem for the parabolic Anderson model
- Weak and almost sure limits for the parabolic Anderson model with heavy tailed potentials
- Subgaussian concentration and rates of convergence in directed polymers