Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Infinitely many collisions between a recurrent simple random walk and arbitrary many transient random walks in a subballistic random environment (2504.15999v1)

Published 22 Apr 2025 in math.PR

Abstract: We consider $d$ random walks $\big(S_n{(j)}\big)_{n\in\mathbb{N}}$, $1\leq j \leq d$, in the same random environment $\omega$ in $\mathbb{Z}$, and a recurrent simple random walk $(Z_n){n\in\mathbb{N}}$ on $\mathbb{Z}$. We assume that, conditionally on the environment $\omega$, all the random walks are independent and start from even initial locations. Our assumption on the law of the environment is such that a single random walk in the environment $\omega$ is transient to the right but subballistic, with parameter $0<\kappa<1/2$. We show that - for every value of $d$ - there are almost surely infinitely many times for which all these random walks, $(Z_n){n\in\mathbb{N}}$ and $\big(S_n{(j)}\big)_{n\in\mathbb{N}}$, $1\leq j \leq d$, are simultaneously at the same location, even though one of them is recurrent and the $d$ others ones are transient.

Summary

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

X Twitter Logo Streamline Icon: https://streamlinehq.com