Related papers: Narrow-escape-time problem: the imperfect trapping…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
We consider the exit problem for a one-dimensional system with random switching near an unstable equilibrium point of the averaged drift. In the infinite switching rate limit, we show that the exit time satisfies a limit theorem with a…
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and…
Questions of flux regulation in biological cells raise renewed interest in the narrow escape problem. The often inadequate expansions of the narrow escape time are due to a not so well known fact that the boundary singularity of Green's…
The mean first-passage time (MFPT) for a Brownian particle to surmount a potential barrier of height $\Delta U$ is a fundamental quantity governing a wide array of physical and chemical processes. According to the Arrhenius Law, the MFPT…
We prove that for a sequence of nested sets $\{U_n\}$ with $\Lambda = \cap_n U_n$ a measure zero set, the localized escape rate converges to the extremal index of $\Lambda$, provided that the dynamical system is $\phi$-mixing at polynomial…
There remains the old question of how long a quantum particle takes to tunnel through a potential barrier higher than its incident kinetic energy. In this article a solution of the question is proposed on the basis of a realistic…
We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…
We consider a dynamical system given by an area-preserving map on a two-dimensional phase plane and consider a one-dimensional line of initial conditions within this plane. We record the number of iterates it takes a trajectory to escape…
We consider a run-and-tumble particle (RTP) in one dimension, subjected to a telegraphic noise with a constant rate $\gamma$, and in the presence of an external confining potential $V(x) = \alpha |x|^p$ with $p \geq 1$. We compute the mean…
We analyze the mean time t_{app} that a randomly moving particle spends in a bounded domain (sphere) before it escapes through a small window in the domain's boundary. A particle is assumed to diffuse freely in the bulk until it approaches…
As a basic dynamic feature on complex networks, the property of random walk has received a lot of attention in recent years. In this paper, we first studied the analytical expression of the mean global first passage time (MGFPT) on the…
We develop a new variant of the wave-packet analysis and solve the tunneling time problem for one particle. Our approach suggests an individual asymptotic description of the quantum subensembles of transmitted and reflected particles both…
The exit time probability, which gives the likelihood that an initial condition leaves a prescribed region of the phase space of a dynamical system at, or before, a given time, is arguably one of the most natural and important transport…
The time at which a one-dimensional continuous strong Markov process attains a boundary point of its state space is a discontinuous path functional and it is, therefore, unclear whether the exit time can be approximated by hitting times of…
Quantum mechanical control of the position of a particle by using a trapping potential well is an important problem for the manipulation of a quantum particle. We study the probability of successful conveyance of a particle trapping in a…
In the barrier escape problem, a random searcher starting at the energy minima tries to escape the barrier under the effect of thermal fluctuations. If the random searcher is subject to successive restarts at the bottom of the well, then…
Atoms confined in a magnetic trap can escape by making spin-flip Majorana transitions due to a breakdown of the adiabatic approximation. Several papers have studied this process for atoms with spin $F = 1/2$ or $F= 1$. The present paper…
The statistics of the slowest first-passage time among a large population of $N$ searchers is crucial for determining the completion time of many stochastic processes. Classical extreme-value theory predicts that for diffusing particles in…
Kramer's theory of activation over a potential barrier consists in computing the mean exit time from the boundary of a basin of attraction of a randomly perturbed dynamical system. Here we report that for some systems, crossing the boundary…