Randomly trapped random walks on mathbb Z^d
classification
🧮 math.PR
keywords
randomrandomlytrappedmathbbscalingwalkclockdiscrete
read the original abstract
We give a complete classification of scaling limits of randomly trapped random walks and associated clock processes on $\mathbb Z^d$, $d\ge 2$. Namely, under the hypothesis that the discrete skeleton of the randomly trapped random walk has a slowly varying return probability, we show that the scaling limit of its clock process is either deterministic linearly growing or a stable subordinator. In the case when the discrete skeleton is a simple random walk on $\mathbb Z^d$, this implies that the scaling limit of the randomly trapped random walk is either Brownian motion or the Fractional Kinetics process, as conjectured in [BCCR13].
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.