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

We consider d random walks (Sn(j))n∈N, 1≤j≤d, in the same random environment ω in Z, and a recurrent simple random walk (Zn)n∈N on Z. We assume that, conditionally on the environment ω, 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 ω is transient to the right but subballistic, with parameter 0<κ<1∕2. We show that – for every value of d – there are almost surely infinitely many times for which all these random walks, (Zn)n∈N and (Sn(j))n∈N, 1≤j≤d, are simultaneously at the same location, even though one of them is recurrent and the d others ones are transient.

Authors

Institutions

Publication Details

Journal
Electronic Communications in Probability
Published
2025-01-01
DOI
https://doi.org/10.1214/25-ecp687
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Alexis Devulder
Electronic Communications in Probability
Stochastic processes and statistical mechanics
article

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

Alexis Devulder
article en

Abstract

We consider d random walks (Sn(j))n∈N, 1≤j≤d, in the same random environment ω in Z, and a recurrent simple random walk (Zn)n∈N on Z. We assume that, conditionally on the environment ω, 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 ω is transient to the right but subballistic, with parameter 0<κ<1∕2. We show that – for every value of d – there are almost surely infinitely many times for which all these random walks, (Zn)n∈N and (Sn(j))n∈N, 1≤j≤d, are simultaneously at the same location, even though one of them is recurrent and the d others ones are transient.

Electronic Communications in ProbabilityVol. 30(none)
Centre National de la Recherche Scientifique (FR), Université de Versailles Saint-Quentin-en-Yvelines (FR), Université Paris-Saclay (FR), Laboratoire de Mathématiques Blaise Pascal (FR), Laboratoire de Mathématiques de Versailles (FR)
Openalex Percentile: Top 85%
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Infinitely many collisions between a recurrent simple random walk and arbitrary many transient random walks in a subballistic random environment — Alexis Devulder · Electronic Communications in Probability (2025) | TGRS Research Map | TGRS