## The Annals of Probability

### Biased random walk in positive random conductances on $\mathbb{Z}^{d}$

Alexander Fribergh

#### Abstract

We study the biased random walk in positive random conductances on $\mathbb{Z}^{d}$. This walk is transient in the direction of the bias. Our main result is that the random walk is ballistic if, and only if, the conductances have finite mean. Moreover, in the sub-ballistic regime we find the polynomial order of the distance moved by the particle. This extends results obtained by Shen [Ann. Appl. Probab. 12 (2002) 477–510], who proved positivity of the speed in the uniformly elliptic setting.

#### Article information

Source
Ann. Probab., Volume 41, Number 6 (2013), 3910-3972.

Dates
First available in Project Euclid: 20 November 2013

https://projecteuclid.org/euclid.aop/1384957779

Digital Object Identifier
doi:10.1214/13-AOP835

Mathematical Reviews number (MathSciNet)
MR3161466

Zentralblatt MATH identifier
1291.60209

Subjects
Primary: 60K37: Processes in random environments

#### Citation

Fribergh, Alexander. Biased random walk in positive random conductances on $\mathbb{Z}^{d}$. Ann. Probab. 41 (2013), no. 6, 3910--3972. doi:10.1214/13-AOP835. https://projecteuclid.org/euclid.aop/1384957779

#### References

• [1] Babson, E. and Benjamini, I. (1999). Cut sets and normed cohomology with applications to percolation. Proc. Amer. Math. Soc. 127 589–597.
• [2] Ben Arous, G., Fribergh, A., Gantert, N. and Hammond, A. (2008). Biased random walks on Galton–Watson trees with leaves. Available at arXiv:0711.3686.
• [3] Ben Arous, G. and Hammond, A. (2011). Randomly biased walks on subcritical trees. Available at arXiv:1101.4041.
• [4] Ben Arous, G., Hu, Y., Olla, S. and Zeitouni, O. (2013). Einstein relation for biased random walk on Galton–Watson trees. Ann. Inst. H. Poincaré Probab. Statist. 49 698–721.
• [5] Ben Arous, G. and Černý, J. (2006). Dynamics of trap models. In Mathematical Statistical Physics 331–394. Elsevier, Amsterdam.
• [6] Berger, N., Gantert, N. and Peres, Y. (2003). The speed of biased random walk on percolation clusters. Probab. Theory Related Fields 126 221–242.
• [7] Carne, T. K. (1985). A transmutation formula for Markov chains. Bull. Sci. Math. (2) 109 399–405.
• [8] Dhar, D. (1984). Diffusion and drift on percolation networks in an external field. J. Phys. A 17 257–259.
• [9] Dhar, D. and Stauffer, D. (1998). Drift and trapping in biased diffusion on disordered lattices. Internat. J. Modern Phys. C 9 349–355.
• [10] Doyle, P. G. and Snell, J. L. (1984). Random Walks and Electric Networks. Carus Mathematical Monographs 22. Mathematical Association of America, Washington, DC.
• [11] Durrett, R. (1984). Oriented percolation in two dimensions. Ann. Probab. 12 999–1040.
• [12] Durrett, R. (1996). Probability: Theory and Examples, 2nd ed. Duxbury Press, Belmont, CA.
• [13] Enriquez, N., Sabot, C. and Zindy, O. (2009). A probabilistic representation of constants in Kesten’s renewal theorem. Probab. Theory Related Fields 144 581–613.
• [14] Enriquez, N., Sabot, C. and Zindy, O. (2009). Limit laws for transient random walks in random environment on $\mathbb{Z}$. Ann. Inst. Fourier (Grenoble) 59 2469–2508.
• [15] Fribergh, A. and Hammond, A. (2011). Phase transition for the speed of the biased random walk on the supercritical percolation cluster. Comm. Pure Appl. To appear.
• [16] Gantert, N., Mathieu, P. and Piatnitski, A. (2010). Einstein relation for reversible diffusions in random environment. Comm. Pure Appl. Math. 65 187–228.
• [17] Hammond, A. (2011). Stable limit laws for randomly biased walks on trees. Available at arXiv:1101.4043.
• [18] Harris, T. E. (1960). A lower bound for the critical probability in a certain percolation process. Math. Proc. Cambridge Philos. Soc. 56 13–20.
• [19] Havlin, S. and Ben-Avraham, D. (2002). Diffusion in disordered media. Adv. Phys. 51 187–292.
• [20] Kesten, H. (1982). Percolation Theory for Mathematicians. Progress in Probability and Statistics 2. Birkhäuser, Basel.
• [21] Lebowitz, J. L. and Rost, H. (1994). The Einstein relation for the displacement of a test particle in a random environment. Stochastic Process. Appl. 54 183–196.
• [22] Liggett, T. M., Schonmann, R. H. and Stacey, A. M. (1996). Domination by product measures. Ann. Probab. 24 1711–1726.
• [23] Lyons, R. and Peres, Y. (2013). Probability on trees and networks. Available at http://mypage.iu.edu/~rdlyons/prbtree/prbtree.html.
• [24] Saloff-Coste, L. (1997). Lectures on finite Markov chains. In Lectures on Probability Theory and Statistics (Saint-Flour, 1996), (P. Bernard, ed.). Lecture Notes in Math. 1665 301–413. Springer, Berlin.
• [25] Shen, L. (2002). Asymptotic properties of certain anisotropic walks in random media. Ann. Appl. Probab. 12 477–510.
• [26] Sznitman, A.-S. (2003). On the anisotropic walk on the supercritical percolation cluster. Comm. Math. Phys. 240 123–148.
• [27] Sznitman, A.-S. (2004). Topics in random walks in random environment. In School and Conference on Probability Theory. ICTP Lect. Notes XVII 203–266 (electronic). Abdus Salam Int. Cent. Theoret. Phys., Trieste.
• [28] Sznitman, A.-S. and Zerner, M. (1999). A law of large numbers for random walks in random environment. Ann. Probab. 27 1851–1869.
• [29] Zeitouni, O. (2004). Random walks in random environment. In Lectures on Probability Theory and Statistics. Lecture Notes in Math. 1837 189–312. Springer, Berlin.