Related papers: Exact solution for mean first-passage time on a ps…
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…
The study of first passage percolation (FPP) for the random interlacements model has been initiated in arXiv:2112.12096, where it is shown that on $\mathbb{Z}^d$, $d\geq 3$, the FPP distance is comparable to the graph distance with high…
Evaluating the completion time of a random algorithm or a running stochastic process is a valuable tip not only from a purely theoretical, but also pragmatic point of view. In the formal sense, this kind of a task is specified in terms of…
Many problems in finance require the information on the first passage time (FPT) of a stochastic process. Mathematically, such problems are often reduced to the evaluation of the probability density of the time for such a process to cross a…
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…
The purpose of this paper is to investigate several analytical methods of solving first passage (FP) problem for the Rouse model, a simplest model of a polymer chain. We show that this problem has to be treated as a multi-dimensional…
We demonstrate that the source to target mean first passage time (MFPT) is approximately given by the potential difference of an electrostatic problem which shows that the MFPT scales like the resistance between the target and a distant…
For rotationally invariant first passage percolation (FPP) on the plane, we use a multi-scale argument to prove stretched exponential concentration of the first passage times at the scale of the standard deviation. Our results are proved…
We study the first-passage-time (FPT) properties of active Brownian particles to reach an absorbing wall in two dimensions. Employing a perturbation approach we obtain exact analytical predictions for the survival and FPT distributions for…
In biochemical reaction networks, the first passage time (FPT) of a reaction quantifies the time it takes for the reaction to first occur, from the initial state. While the mean FPT historically served as a summary metric, a far more…
In the previous chapters, we explored the effects of resetting on networks considering one and two nodes. In this chapter, we will describe a generalization of random walks with resetting to an arbitrary number of nodes $\mathcal{M}$. In…
We investigate the statistics of the first-passage time (FPT) to a fractal self-similar boundary of the Koch snowflake. When the starting position is fixed near the absorbing boundary, the FPT distribution exhibits an apparent power-law…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…
We study the first-passage-time (FPT) properties of an active Brownian particle under stochastic resetting to its initial configuration, comprising its position and orientation, to reach an absorbing wall in two dimensions. Coupling a…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
We present the first fixed-parameter tractable (FPT) algorithms for exact computation of generalized hypertree width (ghw) and fractional hypertree width (fhw). Our algorithms are parameterized by the target width, the rank, and the maximum…
In this article, we investigate an artificial traffic model on scale-free networks. Instead of using the routing strategy of the shortest path, a generalized routing algorithm is introduced to improve the transportation throughput, which is…
We propose a simple scaling theory describing the variation of the mean first passage time (MFPT) $\tau(N,M)$ of a regular block copolymer of chain length $N$ and block size $M$ which is dragged through a selective liquid-liquid interface…
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
We study the first passage statistics to adsorbing boundaries of a Brownian motion in bounded two-dimensional domains of different shapes and configurations of the adsorbing and reflecting boundaries. From extensive numerical analysis we…