Law of large numbers for a finite-range random walk in a dynamic random environment with nonuniform mixing

Abstract

In this paper, we study random walks evolving on Z in a dynamic random environment that we assume to have time correlations that decrease polynomially fast. We show a law of large numbers by generalizing methods already used for the nearest-neighbor framework to the finite-range one. This requires some new ideas to get around the absence of a monotonicity property that was crucial in the proof for the nearest-neighbour case. Our proof works both in discrete and continuous time.

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…