Related papers: Extreme first passage times for random walks on ne…
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…
We determine the survival probability and first-passage time (FPT) to capture for a harmonically trapped particle, diffusing outside an absorbing spherical boundary by directly solving the differential equation for the survival probability.…
The mean first-passage time (MFPT) is one standard measure for the reaction time in thermally activated barrier-crossing processes. While the relationship between MFPTs and phenomenological rate coefficients is known for systems that…
We use a lattice model to study first-passage time distributions of target finding events through complex environments with elongated fibers distributed with different anisotropies and volume occupation fractions. For isotropic systems and…
Many physical phenomena are modeled as stochastic searchers looking for targets. In these models, the probability that a searcher finds a particular target, its so-called hitting probability, is often of considerable interest. In this work…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
We investigate exceedances of the process over a sufficiently high threshold. The exceedances determine the risk of hazardous events like climate catastrophes, huge insurance claims, the loss and delay in telecommunication networks. Due to…
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…
We derive an approximate but fully explicit formula for the mean first-passage time (MFPT) to a small absorbing target of arbitrary shape in a general elongated domain in the plane. Our approximation combines conformal mapping, boundary…
An approach was developed to describe the first passage time (FPT) in multistep stochastic processes with discrete states governed by a master equation (ME). The approach is an extension of the totally absorbing boundary approach given for…
First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
We investigate exceedances of the process over a sufficiently high threshold. The exceedances determine the risk of hazardous events like climate catastrophes, huge insurance claims, the loss and delay in telecommunication networks. Due to…
We introduce and investigate the escape problem for random walkers that may eventually die, decay, bleach, or lose activity during their diffusion towards an escape or reactive region on the boundary of a confining domain. In the case of a…
An ensemble of trajectories with dynamical activity and first-passage time (FPT) is considered in the context of the thermodynamics of trajectories. The relationship between the average FPT and the total change in entropy is determined,…
We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domain and find that it admits a non trivial minimum as function…
We investigate the problem of locating the source of diffusion in complex networks without complete knowledge of nodes' states. Some currently known methods assume the information travels via a single, shortest path, which by assumption is…
In this paper, we propose a class of growth models, named Fibonacci trees $F(t)$, with respect to the intrinsic advantage of Fibonacci sequence $\{F_{t}\}$. First, we turn out model $F(t)$ to have power-law degree distribution with exponent…
A microscopic description of packet transport in the Internet by using a simple cellular automaton model is presented. A generalised exclusion process is introduced which allows to study travel times of the particles ('data packets') along…
We study diffusion of information packets on several classes of structured networks. Packets diffuse from a randomly chosen node to a specified destination in the network. As local transport rules we consider random diffusion and an…