Related papers: Master equations for continuous-time random walks …
The Continuous-Time Random Walk (CTRW) formalism can be adapted to encompass stochastic processes with memory. In this article we will show how the random combination of two different unbiased CTRWs can give raise to a process with clear…
We study analytically, in one dimension, the survival probability $P_{s}(t)$ up to time $t$ of an immobile target surrounded by mutually noninteracting traps each performing a continuous-time random walk (CTRW) in continuous space. We…
In many physical, social or economical phenomena we observe changes of a studied quantity only in discrete, irregularly distributed points in time. The stochastic process used by physicists to describe this kind of variables is the…
Continuous Time Random Walks (CTRW) are widely used to coarse-grain the evolution of systems jumping from a metastable sub-set of their configuration space, or trap, to another via rare intermittent events. The multi-scaled behavior typical…
We study random walks with stochastic resetting to the initial position on arbitrary networks. We obtain the stationary probability distribution as well as the mean and global first passage times, which allow us to characterize the effect…
The combined Continuous Time Random Walk (CTRW) in position and momentum space is introduced, in the form of two coupled integral equations that describe the evolution of the probability distribution for finding a particle at a certain…
For a continuous-time catalytic branching random walk (CBRW) on Z, with an arbitrary finite number of catalysts, we study the asymptotic behavior of position of the rightmost particle when time tends to infinity. The mild requirements…
Continuous time random walks (CTRWs) are versatile models for anomalous diffusion processes that have found widespread application in the quantitative sciences. Their scaling limits are typically non-Markovian, and the computation of their…
We investigate the role of stochastic resetting in non-Markovian systems, where memory effects arise due to slow relaxation, rugged energy landscapes, disordered environments, and molecular crowding. Using the celebrated continuous-time…
A novel version of the Continuous-Time Random Walk (CTRW) model with memory is developed. This memory means the dependence between arbitrary number of successive jumps of the process, while waiting times between jumps are considered as…
We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…
The usual development of the continuous-time random walk (CTRW) proceeds by assuming that the present is one of the jumping times. Under this restrictive assumption integral equations for the propagator and mean escape times have been…
The well-scaled transition to the diffusion limit in the framework of the theory of continuous-time random walk (CTRW)is presented starting from its representation as an infinite series that points out the subordinated character of the CTRW…
We consider a one-dimensional continuous time random walk (CTRW) on a fixed time interval $T$ where at each time step the walker waits a random time $\tau$, before performing a jump drawn from a symmetric continuous probability distribution…
Continuous-time random walks (CTRWs) on discrete state spaces, ranging from regular lattices to complex networks, are ubiquitous across physics, chemistry, and biology. Models with coarse-grained states, for example those employed in…
We perform a thorough analysis of the survival probability of symmetric random walks with stochastic resetting, defined as the probability for the walker not to cross the origin up to time $n$. For continuous symmetric distributions of step…
In this article, we generalize the recent Discrete Time Random Walk (DTRW) algorithm, which was introduced for the computation of probability densities of fractional diffusion. Although it has the same computational complexity and shares…
We consider biased random walks on random networks constituted by a random comb comprising a backbone with quenched-disordered random-length branches. The backbone and the branches run in the direction of the bias. For the bare model as…
Stochastic resetting is a protocol of starting anew, which can be used to facilitate the escape kinetics. We demonstrate that restarting can accelerate the escape kinetics from a finite interval restricted by two absorbing boundaries also…
We investigate the first passage time beyond a barrier located at $b\geq0$ of a random walk with independent and identically distributed jumps, starting from $x_0=0$. The walk is subject to stochastic resetting, meaning that after each step…