Phase transition for the speed of the biased random walk on the supercritical percolation cluster
arXiv:1103.1371
Abstract
We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a critical strength for the bias, such that, below this value, the speed is positive, and, above the value, it is zero. We identify the value of the critical bias explicitly, and, in the sub-ballistic regime, we find the polynomial order of the distance moved by the particle. Each of these conclusions is obtained by investigating the geometry of the traps that are most effective at delaying the walk. A key element in proving our results is to understand that, on large scales, the particle trajectory is essentially one-dimensional; we prove such a `dynamic renormalization' statement in a much stronger form than was previously known.
arXiv comment78 pages with 16 figures. Changes made at the suggestion of a referee, including more detail in Section 8. Comm. Pure Appl. Math., accepted
References in corpus (7)
- Quenched invariance principle for simple random walk on percolation clusters
- Random walks on supercritical percolation clusters
- The universality classes in the parabolic Anderson model
- Bondary-connectivity via graph theory
- Universality and extremal aging for dynamics of spin glasses on sub-exponential time scales
- A proof of the Lyons-Pemantle-Peres monotonicity conjecture for high biases
- Ageing in the parabolic Anderson model