The speed of a biased random walk on a percolation cluster at high density
classification
🧮 math.PR
keywords
percolationrandomspeedwalkbiasedclusteralongcase
read the original abstract
We study the speed of a biased random walk on a percolation cluster on $\Z^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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.