On the speed of biased random walk in translation invariant percolation

From MaRDI portal
Publication:2865809

zbMATH Open1276.60121arXiv1012.3386MaRDI QIDQ2865809FDOQ2865809


Authors: Maria Deijfen, Olle Häggström Edit this on Wikidata


Publication date: 3 December 2013

Published in: ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)

Abstract: For biased random walk on the infinite cluster in supercritical i.i.d. percolation on , where the bias of the walk is quantified by a parameter , it has been conjectured (and partly proved) that there exists a critical value such that the walk has positive speed when and speed zero when . In this paper, biased random walk on the infinite cluster of a certain translation invariant percolation process on 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 such that, for , the random walk has speed zero, while, for , 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.


Full work available at URL: https://arxiv.org/abs/1012.3386




Recommendations





Cited In (5)





This page was built for publication: On the speed of biased random walk in translation invariant percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865809)