On the speed of biased random walk in translation invariant percolation
Maria Deijfen, Olle H\"aggstr\"om

TL;DR
This paper demonstrates that in a specific translation invariant percolation model, the biased random walk exhibits a non-monotonic speed behavior contrary to the conjecture for i.i.d. percolation, with zero speed below a critical bias and positive speed above it.
Contribution
The paper provides a counterexample showing that the expected monotonic relationship between bias and speed does not hold in general translation invariant percolation models.
Findings
Speed is zero for bias below critical value
Speed becomes positive for bias above critical value
Contradicts previous conjectures for i.i.d. percolation
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Random Matrices and Applications
