Related papers: First-passage times in complex scale-invariant med…
Random walks have wide application in real lives, ranging from target search, reaction kinetics, polymer chains, to the forecast of the arrive time of extreme events, diseases or opinions. In this paper, we consider discrete random walks on…
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…
Understanding the topological characteristics of complex networks and how they affect navigability is one of the most important goals in science today, as it plays a central role in various economic, biological, ecological and social…
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.…
This study investigates the first passage time (FPT) properties of particles with a broad class of positive stochastic diffusion coefficients (DCs), representing diffusion in heterogeneous environments or of particles with conformational…
We design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node. According to the Laplace…
It has long been appreciated that transport properties can control reaction kinetics. This effect can be characterized by the time it takes a diffusing molecule to reach a target -- the first-passage time (FPT). Although essential to…
We study the statistics of first passage times (FPTs) of trajectory observables in both classical and quantum Markov processes. We consider specifically the FPTs of counting observables, that is, the times to reach a certain threshold of a…
We investigate two coupled properties of Levy stable random motions: The first passage times (FPTs) and the first passage leapovers (FPLs). While, in general, the FPT problem has been studied quite extensively, the FPL problem has hardly…
Photon transport through turbid media has typically been modeled through diffusion or telegraph equations. These models describe behavior of the average, or typical, photon with remarkable accuracy, however, we show here that they fail to…
In this chapter, we consider the problem of a non-Markovian random walker (displaying memory effects) searching for a target. We review an approach that links the first passage statistics to the properties of trajectories followed by the…
First passage of stochastic processes under resetting has recently been an active research topic in the field of statistical physics. However, most of previous studies mainly focused on the systems with continuous time and space. In this…
The first time a searcher finds a target is called a first passage time (FPT). In many physical, chemical, and biological processes, the searcher is "mortal," which means that the searcher might become inactivated (degrade, die, etc.)…
First-passage processes are pervasive across numerous scientific fields, yet a general framework for understanding their response to external perturbations remains elusive. While the fluctuation-dissipation theorem offers a complete linear…
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 consider a random walk in confined geometry, starting from a site and eventually reaching a target site. We calculate analytically the distribution of the occupation time on a third site, before reaching the target site. The obtained…
We study the time until first occurrence, the first-passage time, of rare density fluctuations in diffusive systems. We approach the problem using a model consisting of many independent random walkers on a lattice. The existence of spatial…
A new mechanism for efficiently solving the Markov decision processes (MDPs) is proposed in this paper. We introduce the notion of reachability landscape where we use the Mean First Passage Time (MFPT) as a means to characterize the…
We study the statistics of the first-passage time of a single run and tumble particle (RTP) in one spatial dimension, with or without resetting, to a fixed target located at $L>0$. First, we compute the first-passage time distribution of a…
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…