Related papers: Inferring Tree Structure with Hidden Traps from Fi…
First passage time (FPT) theory is often used to estimate timescales in cellular and molecular biology. While the overwhelming majority of studies have focused on the time it takes a given single Brownian searcher to reach a target,…
First passage times (FPTs) are often used to study timescales in physical, chemical, and biological processes. FPTs generically describe the time it takes a random "searcher" to find a "target." In many systems, the important timescale is…
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…
We consider a continuous-time random walk model with finite-mean waiting-times and we study the mean first-passage time (MFPT) as estimated by an observer in a reference frame $\mathcal{S}$, that is co-moving with a target, and by an…
We provide exact results for the mean and variance of first-passage times (FPTs) of making a directed revolution in the presence of a bias in heterogeneous quenched environments where the disorder is expressed by random traps on a ring with…
In this paper, we propose a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node. By utilizing the spectral graph theory, we provide an exact formula for mean first-passage time…
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…
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…
For transport processes in geometrically restricted domains, the mean first-passage time (MFPT) admits a general scaling dependence on space parameters for diffusion, anomalous diffusion, and diffusion in disordered or fractal media. For…
We study the first passage time (FPT) problem for biased continuous time random walks. Using the recently formulated framework of fractional Fokker-Planck equations, we obtain the Laplace transform of the FPT density function when the bias…
Recent works have explored the properties of L\'evy flights with resetting in one-dimensional domains and have reported the existence of phase transitions in the phase space of parameters which minimizes the Mean First Passage Time (MFPT)…
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…
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…
Biochemical processes in cells are governed by complex networks of many chemical species interacting stochastically in diverse ways and on different time scales. Constructing microscopically accurate models of such networks is often…
We develop an analytical approach which provides the dependence of the mean first-passage time (MFPT) for random walks on complex networks both on the target connectivity and on the source-target distance. Our approach puts forward two…
As known, the commonly-utilized ways to determine mean first-passage time $\overline{\mathcal{F}}$ for random walk on networks are mainly based on Laplacian spectra. However, methods of this type can become prohibitively complicated and…
Many transport processes in ecology, physics and biochemistry can be described by the average time to first find a site or exit a region, starting from an initial position. Typical mathematical treatments are based on formulations that…
The first-passage time (FPT) is the time it takes a system variable to cross a given boundary for the first time. In the context of Markov networks, the FPT is the time a random walker takes to reach a particular node (target) by hopping…
Geodesic distance, sometimes called shortest path length, has proven useful in a great variety of applications, such as information retrieval on networks including treelike networked models. Here, our goal is to analytically determine the…