The velocity is deterministic in random walk in 2-valued i.i.d. random environment
math.PR
Submitted: 2026-10-29
Updated: 2026-10-29
License: http://creativecommons.org/licenses/by/4.0/
The gist: We prove that the limiting velocity for (nearest-neighbour) random walk in i.i.d.
Abstract
We prove that the limiting velocity for (nearest-neighbour) random walk in i.i.d. random environment is deterministic when the local environment is supported on two points. No ellipticity is assumed. The proof uses a clever adaption (suggested by ChatGPT) of coupling arguments previously developed by the authors. It extends to i.i.d. environments where the local environments are mixtures of two such points.
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves
- A zero-one law for swap-invariant events in uniform spanning forests
- Bernoulli flow for Erd s-R'enyi graphs