Related papers: First Passage Time Distribution and Number of Retu…
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…
We present analytical results for the distribution of first return (FR) times of random walks (RWs) on random regular graphs (RRGs) consisting of $N$ nodes of degree $c \ge 3$. Starting from a random initial node $i$ at time $t=0$, at each…
We study the random walk problem on a deterministic scale-free network, in the presence of a set of static, identical targets; due to the strong inhomogeneity of the underlying structure the mean first-passage time (MFPT), meant as a…
Let (X,d) be a locally compact separable ultra-metric space. Given a reference measure \mu\ on X and a step length distribution on the non-negative reals, we construct a symmetric Markov semigroup P^t acting in L^2(X,\mu). We study the…
The mean first passage time~(MFPT) of random walks is a key quantity characterizing dynamic processes on disordered media. In a random fractal embedded in the Euclidean space, the MFPT is known to obey the power law scaling with the…
Subordinating a random walk to a renewal process yields a continuous time random walk (CTRW) model for diffusion, including the possibility of anomalous diffusion. Transition densities of scaling limits of power law CTRWs have been shown to…
We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…
We derive an approximate but fully explicit formula for the mean first-passage time (MFPT) to a small absorbing target of arbitrary shape in a general elongated domain in the plane. Our approximation combines conformal mapping, boundary…
We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position,…
We consider a bivariate diffusion process and we study the first passage time of one component through a boundary. We prove that its probability density is the unique solution of a new integral equation and we propose a numerical algorithm…
Consider a one dimensional diffusion process on the diffusion interval $I$ originated in $x_0\in I$. Let $a(t)$ and $b(t)$ be two continuous functions of $t$, $t>t_0$ with bounded derivatives and with $a(t)<b(t)$ and $a(t),b(t)\in I$,…
We investigate the dynamics of simultaneous random walkers with resetting on networks and derive exact analytical expressions for the mean first-encounter times of Markovian random walkers. Specifically, we consider two cases for the…
We consider the first exit time of a nonnegative Harris-recurrent Markov process from the interval $[0,A]$ as $A\to\infty$. We provide an alternative method of proof of asymptotic exponentiality of the first exit time (suitably…
We introduce a unified framework for solving first passage times of time-homogeneous diffusion processes. According to the killed version potential theory and the perturbation theory, we are able to deduce closed-form solutions for…
We investigate the fluctuations of the time elapsed until the electric charge transferred through a conductor reaches a given threshold value. For this purpose, we measure the distribution of the first-passage times for the net number of…
General upper bounds on fluctuations of trajectory observables were recently obtained. It turned out that the size of fluctuations of dynamical observable is limited from below and from above. For the moment generating function of general…
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…
First passage distributions of semi-Markov processes are of interest in fields such as reliability, survival analysis, and many others. The problem of finding or computing first passage distributions is, in general, quite challenging. We…
We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…
We investigate some simple and surprising properties of a one-dimensional Brownian trajectory with diffusion coefficient $D$ that starts at the origin and reaches $X$ either: (i) at time $T$ or (ii) for the first time at time $T$. We…