Related papers: A Semi-Markov Algorithm for Continuous Time Random…

In an attempt to extend the mode coupling theory (MCT) to lower temperatures, an Unified theory was proposed which within the MCT framework incorporated the activated dynamics via the random first order transition theory (RFOT). Here we…

Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and…

Rough volatility models have recently been empirically shown to provide a good fit to historical volatility time series and implied volatility smiles of SPX options. They are continuous-time stochastic volatility models, whose volatility…

Continuous time random walk (CTRW) subdiffusion along with the associated fractional Fokker-Planck equation (FFPE) is traditionally based on the premise of random clock with divergent mean period. This work considers an alternative CTRW and…

The inference of Markov models from data on stochastic dynamical trajectories over the large time-window $T$ is revisited via the Large Deviations at Level 2.5 for the time-empirical density and the time-empirical flows. The goal is to…

We give conditions under which near-critical stochastic processes on the half-line have infinitely many or finitely many cutpoints, generalizing existing results on nearest-neighbour random walks to adapted processes with bounded increments…

We develop the idea of non-Markovian CTRW (continuous time random walk) approximation to the evolution of interacting particle systems, which leads to a general class of fractional kinetic measure-valued evolutions with variable order. We…

We are interested in the analysis of very large continuous-time Markov chains (CTMCs) with many distinct rates. Such models arise naturally in the context of reliability analysis, e.g., of computer network performability analysis, of power…

Continuous-time random walks are generalisations of random walks frequently used to account for the consistent observations that many molecules in living cells undergo anomalous diffusion, i.e. subdiffusion. Here, we describe the…

In this paper, we present a numerical framework for constructing bounds on stationary performance measures of random walks in the positive orthant using the Markov reward approach. These bounds are established in terms of stationary…

Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…

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…

We study the long time behaviour of a Markov process evolving in $\mathbb{N}$ and conditioned not to hit 0. Assuming that the process comes back quickly from infinity, we prove that the process admits a unique quasi-stationary distribution…

We consider a Markov jump process on a general state space to which we apply a time-dependent weak perturbation over a finite time interval. By martingale-based stochastic calculus, under a suitable exponential moment bound for the…

The continuous-time quantum walks (CTQWs) are a fundamental tool in the development of quantum algorithms. Recently, it was shown that discretizations of p-adic Schr\"odinger equations give rise to continuous-time quantum Markov chains…

Recently, in ["The coin-turning walk and its scaling limit", Electronic Journal of Probability, 25 (2020)], the ``coin-turning walk'' was introduced on ${\mathbb Z}$. It is a non-Markovian process where the steps form a (possibly)…

In this paper, we provide a methodology for computing the probability distribution of sojourn times for a wide class of Markov chains. Our methodology consists in writing out linear systems and matrix equations for generating functions…

The subcritical Markov branching process X(t) starting with one particle as the initial condition has the ultimate extinction probability q = 1. The branching mechanism in consideration is defined by the mixture of logarithmic distributions…

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…

We propose a reaction-transport model for CTRW with non-linear reactions and non-exponential waiting time distributions. We derive non-linear evolution equation for mesoscopic density of particles. We apply this equation to the problem of…