Related papers: Exact calculations of first-passage quantities on …
We study the first passage times of discrete-time branching random walks in ${\mathbb R}^d$ where $d\geq 1$. Here, the genealogy of the particles follows a supercritical Galton-Watson process. We provide asymptotics of the first passage…
We introduce a perturbative method to calculate all moments of the first-passage time distribution in stochastic one-dimensional processes which are subject to both white and coloured noise. This class of non-Markovian processes is at the…
First passage percolation with recovery is a process aimed at modeling the spread of epidemics. On a graph $G$ place a red particle at a reference vertex $o$ and colorless particles (seeds) at all other vertices. The red particle starts…
We consider the quantum first detection problem for a particle evolving on a graph under repeated projective measurements with fixed rate $1/\tau$. A general formula for the mean first detected transition time is obtained for a quantum walk…
We investigate the first passage statistics of active continuous time random walks with Poissonian waiting time distribution on a one dimensional infinite lattice and a two dimensional infinite square lattice. We study the small and large…
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…
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 calculate the mean shape of transition paths and first-passage paths based on the one-dimensional Fokker-Planck equation in an arbitrary free energy landscape including a general inhomogeneous diffusivity profile. The transition path…
We introduce a general approach for the study of the collective dynamics of non-interacting random walkers on connected networks. We analyze the movement of $R$ independent (Markovian) walkers, each defined by its own transition matrix. By…
We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any…
We consider the first-passage percolation problem on the random graph with vertex set N\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for…
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…
We propose a very efficient method for pricing various types of lookback options under Markov models. We utilize the model-free representations of lookback option prices as integrals of first passage probabilities. We combine efficient…
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 the crossing time statistic of diffusing point particles between the two ends of expanding and narrowing two-dimensional conical channels under a transverse external gravitational field. The theoretical expression for the mean…
Quantifying how spatial disorder affects the movement of a diffusing particle or agent is fundamental to target search studies. When diffusion occurs on a network, that is on a highly disordered environment, we lack the mathematical tools…
We consider the boundary crossing problem for time-homogeneous diffusions and general curvilinear boundaries. Bounds are derived for the approximation error of the one-sided (upper) boundary crossing probability when replacing the original…
Random search for one or more targets in a bounded domain occurs widely in nature, with examples ranging from animal foraging to the transport of vesicles within cells. Most theoretical studies take a searcher-centric viewpoint, focusing on…
Above two dimensions, diffusion of a particle in a medium with quenched random traps is believed to be well-described by the annealed continuous time random walk (CTRW). We propose an approximate expression for the first-passage-time (FPT)…
The exact mean time between encounters of a given particle in a system consisting of many particles undergoing random walks in discrete time is calculated, on both regular and complex networks. Analytical results are obtained both for…