Related papers: First-passage times in complex scale-invariant med…
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…
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…
The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact…
It is considered the integrated process $X(t)= x + \int _0^t Y(s) ds ,$ where $Y(t)$ is a Gauss-Markov process starting from $y.$ The first-passage time (FPT) of $X$ through a constant boundary and the first-exit time of $X$ from an…
Often sharp changes in cellular behavior are triggered by thresholded events, i.e., by the attainment of a threshold value of a relevant cellular or molecular dynamical variable. Since the governing variable itself typically undergoes noisy…
The classical theory of chemical reactions can be understood in terms of diffusive barrier crossing, where the rate of a reaction is determined by the inverse of the mean first passage time (FPT) to cross a free energy barrier. Whenever a…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of $N$ nodes of degree $c \ge 3$. Starting from a random initial node at time $t=0$, at each time…
The first-passage time (FPT) of a stochastic signal to a threshold is a fundamental observable across physics, biology, and finance. While renewal shot noise is a canonical model for such signals, analytical results for its FPT have…
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…
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…
First-passage time (FPT) of an Ornstein-Uhlenbeck (OU) process is of immense interest in a variety of contexts. This paper considers an OU process with two boundaries, one of which is absorbing while the other one could be either reflecting…
Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple…
Finding a target in a complex environment is a fundamental challenge in nature, from chemical reactions to sperm reaching an egg. An effective strategy to reduce the time needed to reach a target is to deploy many searchers, increasing the…
We introduce a non-equilibrium discrete-time random walk model on multiplex networks, in which at each time step the walker first undergoes a random jump between neighboring nodes in the same layer, and then tries to hop from one node to…
We give exact and explicit expressions of mean first-passage times for random walks in a rectangular domain, in both cases of reflecting boundary conditions and periodic boundary conditions. The situations with one or two absorbing targets…
A one-dimensional run-and-tumble particle (RTP) switches randomly between a left and right moving state of constant speed $v$. This type of motion arises in a wide range of applications in cell biology, including the unbiased growth and…
We obtain an exact formula for the first-passage time probability distribution for random walks on complex networks using inverse Laplace transform. We write the formula as the summation of finitely many terms with different frequencies…
We study the mean traversal time for a class of random walks on Newman-Watts small-world networks, in which steps around the edge of the network occur with a transition rate F that is different from the rate f for steps across small-world…
In this paper, we consider discrete time random walks on the pseudofractal scale-free web (PSFW) and we study analytically the related first passage properties. First, we classify the nodes of the PSFW into different levels and propose a…