Related papers: A Universal Algorithm for Continuous Time Random W…
The aim of this paper is to deepen the analysis of the asymptotic behavior of the so-called minimal random walk (MRW) using a new martingale approach. The MRW is a discrete-time random walk with infinite memory that has three regimes…
The continuous-time random walk (CTRW) is a pure-jump stochastic process with several applications in physics, but also in insurance, finance and economics. A definition is given for a class of stochastic integrals driven by a CTRW, that…
Discrete-time quantum walks (DTQWs) in random artificial electric and gravitational fields are studied analytically and numerically. The analytical computations are carried by a new method which allows a direct exact analytical…
We consider continuous time random walks (CTRW) for open systems that exchange energy and matter with multiple reservoirs. Each waiting time distribution (WTD) for times between steps is characterized by a positive parameter a, which is set…
The diffusion equation and its time-fractional counterpart can be obtained via the diffusion limit of continuous-time random walks with exponential and heavy-tailed waiting time distributions. The space dependent variable-order…
The fractional diffusion equation is derived from the master equation of continuous-time random walks (CTRWs) via a straightforward application of the Gnedenko-Kolmogorov limit theorem. The Cauchy problem for the fractional diffusion…
It has been alleged in several papers that the so called delayed continuous-time random walks (DCTRWs) provide a model for the one-dimensional telegraph equation at microscopic level. This conclusion, being widespread now, is strange, since…
We study continuous time random walks (CTRW) with power law distribution of waiting times under resetting which brings the walker back to the origin, with a power-law distribution of times between the resetting events. Two situations are…
We show the asymptotic long-time equivalence of a generic power law waiting time distribution to the Mittag-Leffler waiting time distribution, characteristic for a time fractional CTRW. This asymptotic equivalence is effected by a…
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…
We consider continuous time random walks (CTRW) and discuss situations pertinent to aging. These correspond to the case when the initial state of the system is known not at preparation (at $t=0$) but at the later instant of time $t_1>0$…
The usual development of the continuous time random walk (CTRW) assumes that jumps and time intervals are a two-dimensional set of independent and identically distributed random variables. In this paper we address the theoretical setting of…
We show that for a weakly dense subset of the domain of attraction of a positive stable random variable of index $0<\alpha<1$($DOA\left(\alpha\right))$ the functional stable convergence is a time-changed renewal convergence of distribution…
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…
In this paper we deal with anomalous diffusions induced by Continuous Time Random Walks - CTRW in $\mathbb{R}^n$. A particle moves in $\mathbb{R}^n$ in such a way that the probability density function $u(\cdot,t)$ of finding it in region…
Continuous time random walks are non-Markovian stochastic processes, which are only partly characterized by single-time probability distributions. We derive a closed evolution equation for joint two-point probability density functions of a…
Continuous-time random walk (CTRW) is a model of anomalous sub-diffusion in which particles are immobilized for random times between successive jumps. A power-law distribution of the waiting times, $\psi(\tau) \tau^{-(1+\alpha)}$, leads to…
We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
The Random Walks (RW) algorithm is one of the most e - cient and easy-to-use probabilistic segmentation methods. By combining contrast terms with prior terms, it provides accurate segmentations of medical images in a fully automated manner.…