First-return time in fractional kinetics

Abstract

The first-return time is the time that it takes a random walker to go back to the initial position for the first time. We study the first-return time when random walkers perform fractional kinetics, specifically fractional diffusion, that is modelled within the framework of the continuous-time random walk on homogeneous space in the uncoupled formulation with Mittag-Leffler distributed waiting-times. We consider both Markovian and non-Markovian settings, as well as any kind of symmetric jump-size distributions, namely with finite or infinite variance. We show that the first-return time density is indeed independent of the jump-size distribution when it is symmetric, and therefore it is affected only by the waiting-time distribution that embodies the memory of the process. We perform our analysis in two cases: first jump then wait and first wait then jump, and we provide several exact results, including the relation between results in the Markovian and non-Markovian settings and the difference between the two cases.

19 pages

References in corpus (11)

• Persistence and First-Passage Properties in Non-equilibrium Systems
• First passage and arrival time densities for Lévy flights and the failure of the method of images
• Leapover lengths and first passage time statistics for Lévy flights
• Universal First-passage Properties of Discrete-time Random Walks and Levy Flights on a Line: Statistics of the Global Maximum and Records
• Unified Solution of the Expected Maximum of a Random Walk and the Discrete Flux to a Spherical Trap
• Survival Probability of Random Walks and Lévy Flights on a Semi-Infinite Line
• Optimal random search, fractional dynamics and fractional calculus
• Average trajectory of returning walks
• Universal survival probability for a correlated random walk and applications to records
• An elementary derivation of first and last return times of 1D random walks
• The joint distribution of first return times and of the number of distinct sites visited by a 1D random walk before returning to the origin