Open Access
September 2010 The speed of a biased random walk on a percolation cluster at high density
Alexander Fribergh
Ann. Probab. 38(5): 1717-1782 (September 2010). DOI: 10.1214/09-AOP521

Abstract

We study the speed of a biased random walk on a percolation cluster on ℤd in function of the percolation parameter p. We obtain a first order expansion of the speed at p=1 which proves that percolating slows down the random walk at least in the case where the drift is along a component of the lattice.

Citation

Download Citation

Alexander Fribergh. "The speed of a biased random walk on a percolation cluster at high density." Ann. Probab. 38 (5) 1717 - 1782, September 2010. https://doi.org/10.1214/09-AOP521

Information

Published: September 2010
First available in Project Euclid: 17 August 2010

zbMATH: 1205.60171
MathSciNet: MR2722785
Digital Object Identifier: 10.1214/09-AOP521

Subjects:
Primary: 60K37
Secondary: 60D05 , 60J45

Keywords: Electrical networks , Kalikow , percolation cluster , Random walk in random conductances

Rights: Copyright © 2010 Institute of Mathematical Statistics

Vol.38 • No. 5 • September 2010
Back to Top