Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Holmes et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: