Related papers: Rapid state-recrossing kinetics in non-Markovian s…
How much time does it take for a fluctuating system, such as a polymer chain, to reach a target configuration that is rarely visited -- typically because of a high energy cost ? This question generally amounts to the determination of the…
The first passage time (FPT) distribution for random walk in complex networks is calculated through an asymptotic analysis. For network with size $N$ and short relaxation time $\tau\ll N$, the computed mean first passage time (MFPT), which…
In this chapter, we consider the problem of a non-Markovian random walker (displaying memory effects) searching for a target. We review an approach that links the first passage statistics to the properties of trajectories followed by the…
Motivated by the dynamics of resonant neurons we discuss the properties of the first passage time (FPT) densities for nonmarkovian differentiable random processes. We start from an exact expression for the FPT density in terms of an…
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…
An analytical expression is derived for the transition path time distribution for a one-dimensional particle crossing of a parabolic barrier. Two cases are analyzed: (i) A non-Markovian process described by a generalized Langevin equation…
We present the statistical method as a direct extension of the mean first-passage time concept to the analysis of molecular dynamics simulation data of a phase transformation. According to the method, the mean first-passage time…
Extensive empirical investigation has shown that a plethora of real networks synchronously exhibit scale-free and modular structure, and it is thus of great importance to uncover the effects of these two striking properties on various…
Numerous applications all the way from biology and physics to economics depend on the density of first crossings over a boundary. Motivated by the lack of analytical tools for computing first-passage time densities (FPTDs) for complex…
Based on the mean first passage time (MFPT) theory, we derive the expression of the MFPT in the energy-diffusion controlled regime with a power-law distribution. We discuss the finite barrier effect (i.e. thermal energy is not small with…
In this work we propose a novel method to calculate mean first-passage times (MFPTs) for random walks on graphs, based on a dimensionality reduction technique for Markov State Models, known as local-equilibrium (LE). We show that for a…
We consider a continuous-time random walk model with finite-mean waiting-times and we study the mean first-passage time (MFPT) as estimated by an observer in a reference frame $\mathcal{S}$, that is co-moving with a target, and by an…
For random walks on networks (graphs), it is a theoretical challenge to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs. In this paper, we study the MFPT of random walks in the famous…
The mean first passage time, one of the important characteristics for a stochastic process, is often calculated assuming the observation time is infinite. However, in practice, the observation time, T, is always finite and the mean first…
The determination of mean first-passage time (MFPT) for random walks in networks is a theoretical challenge, and is a topic of considerable recent interest within the physics community. In this paper, according to the known connections…
We extend the random walk framework to include compounded steps, providing first-passage time (FPT) properties for a new class of superdiffusive processes, which are governed by the space-fractional spectral Fokker-Planck equation. This…
First-passage times provide invaluable insight into fundamental properties of stochastic processes. Yet, various forms of gating mask first-passage times and differentiate them from actual detection times. For instance, imperfect conditions…
The behavior of a particle in a solvent has been framed using stochastic dynamics since the early theory of Kramers. A particle in a chemical reaction reacts slower in a diluted solvent because of the lack of energy transfer via collisions.…
In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of…
For predicting the kinetics of nucleic acid reactions, continuous-time Markov chains (CTMCs) are widely used. The rate of a reaction can be obtained through the mean first passage time (MFPT) of its CTMC. However, a typical issue in CTMCs…