Search arXivSearch

arXiv · 2401.10179

An Invariance Principle for a Random Walk Among Moving Traps via Thermodynamic Formalism

Abstract

We consider a random walk among a Poisson cloud of moving traps on ${\mathbb Z}^d$, where the walk is killed at a rate proportional to the number of traps occupying the same position. In dimension $d=1$, we have previously shown that under the annealed law of the random walk conditioned on survival up to time $t$, the walk is sub-diffusive. Here we show that in $d\geq 6$ and under diffusive scaling, this annealed law satisfies an invariance principle with a positive diffusion constant if the killing rate is small. Our proof is based on the theory of thermodynamic formalism, where we extend some classic results for Markov shifts with a finite alphabet and a potential of summable variation to the case of an uncountable non-compact alphabet.

Explore related subjects

Keep this discovery

BibTeXRIS

Siva Athreya, Alexander Drewitz, Rongfeng Sun. 2024-01-18. An Invariance Principle for a Random Walk Among Moving Traps via Thermodynamic Formalism. https://arxiv.org/abs/2401.10179

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR