Related papers: Ring structures and mean first passage time in net…
In this paper, we are concerned with mean hitting time $\langle\mathcal{H}\rangle$ for random walks on recursive growth tree networks that are built based on an arbitrary tree as the seed via implementing various primitive graphic…
We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes…
First passage time plays a fundamental role in dynamical characterization of stochastic processes. Crucially, our current understanding on the problem is almost entirely relies on the theoretical formulations, which assume the processes…
A wide variety of real-life networks share two remarkable generic topological properties: scale-free behavior and modular organization, and it is natural and important to study how these two features affect the dynamical processes taking…
Narrow escape and narrow capture problems which describe the average times required to stop the motion of a randomly travelling particle within a domain have applications in various areas of science. While for general domains, it is known…
This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30,197-207, (1986)…
We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…
We present analytical results for the distribution of first hitting times of random walks (RWs) on random regular graphs (RRGs) of degree $c \ge 3$ and a finite size $N$. Starting from a random initial node at time $t=1$, at each time step…
First-passage times are often the most relevant aspect of a complex Markovian network, because they signify when information processing has resulted in a definite decision. Previous studies have shown that for kinetic proofreading networks…
In principle, the generalized master equation can be used to efficiently compute the macroscopic first passage time (FPT) distribution of a complex stochastic system from short-term microscopic simulation data. However, computing its…
For many stochastic dynamic systems, the Mean First Passage Time (MFPT) is a useful concept, which gives expected time before a state of interest. This work is an extension of MFPT in several ways. (1) We show that for some systems the…
We study numerically the mean access times for random walks on hybrid disordered structures formed by embedding scale-free networks into regular lattices, considering different transition rates for steps across lattice bonds ($F$) and…
We consider a general class of maps of the interval having Lyapunov subexponential instability $|\delta x_{t}|\sim|\delta x_{0}|\exp[\Lambda_{t}(x_{0})\zeta(t)]$, where $\zeta(t)$ grows sublinearly as $t\rightarrow\infty$. We outline here a…
Based on the analysis of probability flow, where the First Passage (FP) is realised as the sink of probability, we summarise the protocol to find the distribution of the First Passage Time (FTP). We also describe the corresponding formula…
The concept of a mean first passage time is used to study the time lapse over which a fissioning system may emit light particles. The influence of the "transient" and "saddle to scission times" on this emission are critically examined. It…
We consider the mean first passage time of a random walker moving in a potential landscape on a finite interval, starting and end points being at different potentials. From analytical calculations and Monte Carlo simulations we demonstrate…
In this work, we investigate the temporal evolution of the degree of a given vertex in a network by mapping the dynamics into a random walk problem in degree space. We analyze when the degree approximates a pre-established value through a…
We investigate the large deviation probabilities of first passage times (FPT) of discrete-time supercritical non-lattice branching random walks (BRWs) in $\mathbb{R}^d$ where $d\geq 1$. The FPT refers to the first time the BRW enters a ball…
The transition mechanism of jump processes between two different subsets in state space reveals important dynamical information of the processes and therefore has attracted considerable attention in the past years. In this paper, we study…
Finding representative reaction pathways is necessary for understanding mechanisms of molecular processes, but is considered to be extremely challenging. We propose a new method to construct reaction paths based on mean first-passage times.…