On the speed of biased random walk in translation invariant percolation

preprint2010arXivOpen access

Abstract

For biased random walk on the infinite cluster in supercritical i.i.d.\ percolation on Z2\Z^2, where the bias of the walk is quantified by a parameter β>1β>1, it has been conjectured (and partly proved) that there exists a critical value βc>1β_c>1 such that the walk has positive speed when β<βcβ<β_c and speed zero when β>βcβ>β_c. In this paper, biased random walk on the infinite cluster of a certain translation invariant percolation process on Z2\Z^2 is considered. The example is shown to exhibit the opposite behavior to what is expected for i.i.d.\ percolation, in the sense that it has a critical value βcβ_c such that, for β<βcβ<β_c, the random walk has speed zero, while, for β>βcβ>β_c, the speed is positive. Hence the monotonicity in ββ that is part of the conjecture for i.i.d.\ percolation cannot be extended to general translation invariant percolation processes.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.