Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 83 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 30 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 174 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

Random walk in a high density dynamic random environment (1305.0923v1)

Published 4 May 2013 in math.PR

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 $\Zd$, $d \geq 1$. The red particles jump at rate 1 and are in a Poisson equilibrium with density $\mu$. 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 $\mu\to\infty$, 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 \cite{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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.