Biased random walk on the critical curve of dynamical percolation

Abstract

We study biased random walks on dynamical percolation in $\mathbb{Z}^d$, which were recently introduced by Andres et al. We provide a second order expansion for the asymptotic speed and show for $d \ge 2$ that the speed of the biased random walk on the critical curve is eventually monotone increasing. Our methods are based on studying the environment seen from the walker as well as a combination of ergodicity and several couplings arguments.