Random walk in a high density dynamic random environment
Abstract
The goal of this note is to prove a law of large numbers for the empirical speed of a green particle that performs a random walk on top of a field of red particles which themselves perform independent simple random walks on d, d ≥ 1. The red particles jump at rate 1 and are in a Poisson equilibrium with density μ. The green particle also jumps at rate 1, but uses different transition kernels p' and p'' depending on whether it sees a red particle or not. It is shown that, in the limit as μ∞, the speed of the green particle tends to the average jump under p'. This result is far from surprising, but it is non-trivial to prove. The proof that is given in this note is based on techniques that were developed in KeSi to deal with spread-of-infection models. The main difficulty is that, due to particle conservation, space-time correlations in the field of red particles decay slowly. This places the problem in a class of random walks in dynamic random environments for which scaling laws are hard to obtain.
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.