2000 character limit reached
Biased random walk on the interlacement set (1610.02979v2)
Published 10 Oct 2016 in math.PR
Abstract: We study a biased random walk on the interlacement set of $\mathbb{Z}d$ for $d\geq 3$. Although the walk is always transient, we can show, in the case $d=3$, that for any value of the bias the walk has a zero limiting speed and actually moves slower than any power.
Collections
Sign up for free to add this paper to one or more collections.