Law of large numbers for non-elliptic random walks in dynamic random environments

Abstract

We prove a law of large numbers for a class of d-valued random walks in dynamic random environments, including non-elliptic examples. We assume for the random environment a mixing property called conditional cone-mixing and that the random walk tends to stay inside wide enough space-time cones. The proof is based on a generalization of a regeneration scheme developed by Comets and Zeitouni for static random environments and adapted by Avena, den Hollander and Redig to dynamic random environments. A number of one-dimensional examples are given. In some cases, the sign of the speed can be determined.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…