Related papers: The Narrow Escape problem in a flat cylindrical mi…
Recovering the position of a source from the fluxes of diffusing particles through small receptors allows a biological cell to determine its relative position, spatial localization and guide it to a final target. However, how a source can…
Adsorption to a surface, reversible-binding, and trapping are all prevalent scenarios where particles exhibit "stickiness". Escape and first-passage times are known to be drastically affected, but detailed understanding of this phenomenon…
We study dynamical properties of confined, self-propelled Brownian particles in an inhomogeneous activity profile. Using Brownian dynamics simulations, we calculate the probability to reach a fixed target and the mean first passage time to…
The mean first passage time~(MFPT) of random walks is a key quantity characterizing dynamic processes on disordered media. In a random fractal embedded in the Euclidean space, the MFPT is known to obey the power law scaling with the…
In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm was already introduced in both the Brownian context and in the Ornstein-Uhlenbeck context. Here…
We consider an obliquely reflected Brownian motion $Z$ with positive drift in a quadrant stopped at time $T$, where $T:=\inf \{ t>0 : Z(t)=(0,0) \}$ is the first hitting time of the origin. Such a process can be defined even in the…
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…
The first passage time (FPT) problem is studied for superstatistical models assuming that the mesoscopic system dynamics is described by a Fokker-Planck equation. We show that all moments of the random intensive parameter associated to the…
We analyze the mean time t_{app} that a randomly moving particle spends in a bounded domain (sphere) before it escapes through a small window in the domain's boundary. A particle is assumed to diffuse freely in the bulk until it approaches…
We consider a bivariate diffusion process and we study the first passage time of one component through a boundary. We prove that its probability density is the unique solution of a new integral equation and we propose a numerical algorithm…
We present an efficient method to solve the narrow capture and narrow escape problems for the sphere. The narrow capture problem models the equilibrium behavior of a Brownian particle in the exterior of a sphere whose surface is reflective,…
Many problems in physics, biology, and economics depend upon the duration of time required for a diffusing particle to cross a boundary. As such, calculations of the distribution of first passage time, and in particular the mean first…
We study the noise-driven escape of active Brownian particles (ABPs) and run-and-tumble particles (RTPs) from confining potentials. In the small noise limit, we provide an exact expression for the escape rate in term of a variational…
We consider a Markovian jumping process with two absorbing barriers, for which the waiting-time distribution involves a position-dependent coefficient. We solve the Fokker-Planck equation with boundary conditions and calculate the mean…
We study diffusion with a bias towards a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability $p$ of the…
How much time does it take for a fluctuating system, such as a polymer chain, to reach a target configuration that is rarely visited -- typically because of a high energy cost ? This question generally amounts to the determination of the…
The timescales of many physical, chemical, and biological processes are determined by first passage times (FPTs) of diffusion. The overwhelming majority of FPT research studies the time it takes a single diffusive searcher to find a target.…
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media,…
The first passage time (FPT) distribution for random walk in complex networks is calculated through an asymptotic analysis. For network with size $N$ and short relaxation time $\tau\ll N$, the computed mean first passage time (MFPT), which…
First passage time (FPT) is the time a particle, subject to some stochastic process, hits or crosses a closed surface for the very first time. $\tau$-leaping methods are a class of stochastic algorithms in which, instead of simulating every…