Related papers: Capture of a diffusive prey by multiple predators …
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 experimentally, numerically and theoretically the optimal mean time needed by a Brownian particle, freely diffusing either in one or two dimensions, to reach, within a tolerance radius $R_{\text tol}$, a target at a distance $L$…
We investigate the average time for the earliest particle to hit a spherical absorber when a homogeneous gas of freely diffusing particles with density $\rho$ and diffusivity $D$ is prepared in a deterministic state and is initially…
A variation of Rosenstock's trapping model in which $N$ independent random walkers are all initially placed upon a site of a one-dimensional lattice in the presence of a {\em one-sided} random distribution (with probability $c$) of…
We explore the effect of stochastic resetting on the first-passage properties of space-dependent diffusion in presence of a constant bias. In our analytically tractable model system, a particle diffusing in a linear potential…
The problem of the time required for a diffusing molecule, within a large bounded domain, to first locate a small target is prevalent in biological modeling. Here we study this problem for a small spherical target. We develop uniform in…
We introduce a new class of first passage time optimization driven by threshold resetting, inspired by many natural processes where crossing a critical limit triggers failure, degradation or transition. In here, search agents are…
In this paper we develop an encounter-based model of reaction-subdiffusion in a domain $\Omega$ with a partially absorbing interior trap $\calU\subset \Omega$. We assume that the particle can freely enter and exit $\calU$, but is only…
We investigate random searches under stochastic position resetting at rate $r$, in a bounded 1D environment with space-dependent diffusivity $D(x)$. For arbitrary shapes of $D(x)$ and prescriptions of the associated multiplicative…
Given an endogenous timescale set by invasion in a constant environment, we introduced periodic temporal variation in competitive superiority by alternating the species' propagation rates. By manipulating habitat size and introduction rate,…
We consider the problem of bounding mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents. The quantitative analysis of such probabilistic population…
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 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 a master equation approach to the \emph{narrow escape time} (NET) problem, i.e. the time needed for a particle contained in a confining domain with a single narrow opening, to exit the domain for the first time. We introduce a…
Optimal random foraging strategy has gained increasing concentrations. It is shown that L\'evy flight is more efficient compared with the Brownian motion when the targets are sparse. However, standard L\'evy flight generally cannot be…
We show that the distribution of times for a diffusing particle to first hit an absorber is \emph{independent} of the direction of an external flow field, when we condition on the event that the particle reaches the target for flow away…
During a random search, resetting the searcher's position from time to time to the starting point often reduces the mean completion time of the process. Although many different resetting models have been studied over the past ten years,…
We study the survival of a prey that is hunted by N predators. The predators perform independent random walks on a square lattice with V sites and start a direct chase whenever the prey appears within their sighting range. The prey is…
We propose an approach for estimating the probability that a given small target, among many, will be the first to be reached in a molecular dynamics simulation. Reaching small targets out of a vast number of possible configurations…
We present a systematic analytical approach to the trapping of a random walk by a finite density rho of diffusing traps in arbitrary dimension d. We confirm the phenomenologically predicted e^{-c_d rho t^{d/2}} time decay of the survival…