Related papers: Ruelle-Bowen continuous-time random walk
We consider a particle moving in continuous time as a Markov jump process; its discrete chain is given by an ordinary random walk on ${\mathbb Z}^d$ , and its jump rate at $({\mathbf x},t)$ is given by a fixed function $\varphi$ of the…
We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…
We study a one-dimensional Markov modulated random walk with jumps. It is assumed that amplitudes of jumps as well as a chosen velocity regime are random and depend on a time spent by the process at a previous state of the underlying Markov…
A deterministic walk in a random environment can be understood as a general random process with finite-range dependence that starts repeating a loop once it reaches a site it has visited before. Such process lacks the Markov property. We…
Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph…
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…
Continuous time random Walk model has been versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as disordered or porous media. We are studying the continuous limits of Heterogeneous…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
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 consider a continuous-time random walk which is defined as an interpolation of a random walk on a point process on the real line. The distances between neighboring points of the point process are i.i.d. random variables in the normal…
We consider transport over a strongly connected, directed graph. The scheduling amounts to selecting transition probabilities for a discrete-time Markov evolution which is designed to be consistent with certain initial and final marginals.…
We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…
We investigate the dynamics of a particle executing a general Continuous Time Random Walk (CTRW) in three dimensions under the influence of arbitrary time-varying external fields. Contrary to the general approach in recent works, our method…
Piecewise-deterministic Markov processes form a general class of non-diffusion stochastic models that involve both deterministic trajectories and random jumps at random times. In this paper, we state a new characterization of the jump rate…
Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…
The reciprocal class of a Markov path measure is the set of all mixtures of its bridges. We give characterizations of the reciprocal class of a continuous-time Markov random walk on a graph. Our main result is in terms of some reciprocal…
We investigate a piecewise-deterministic Markov process, evolving on a Polish metric space, whose deterministic behaviour between random jumps is governed by some semi-flow, and any state right after the jump is attained by a randomly…
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…