Related papers: Optimal diffusive search: nonequilibrium resetting…
Consider a stochastic search model with resetting for an unknown stationary target $a\in\mathbb{R}$ with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion constant $D$. The searcher is…
Search processes are a fundamental part of natural and artificial systems. In such settings, the number of searchers is rarely constant: new agents may be recruited while others can abandon the search. Despite the ubiquity of these…
Active particles, which are self-propelled nonequilibrium systems, are modelled by overdamped Langevin equations with colored noise, emulating the self-propulsion. In this chapter, we present a review of the theoretical results for the…
Diffusion with stochastic resetting, instantaneous returns of a diffusing particle to a reference point, creates a stationary probability distribution. The paradigm is extended here to a doubly stochastic protocol in which the resetting…
We consider a stochastic search model with resetting for an unknown stationary target $a\in\mathbb{R}^d,\ d\ge1$, with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion coefficient $D$.…
We study the target searching on the DNA for proteins in the presence of non-constant drift and non-Gaussian $\alpha$-stable L\'evy fluctuations. The target searching is realized by the facilitated diffusion process. The existing works are…
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…
We investigate a diffusion process in heterogeneous media where particles stochastically reset to their initial positions at a constant rate. The heterogeneous media is modeled using a spatial-dependent diffusion coefficient with a…
Stochastic interactions generically enhance self-diffusivity in living and biological systems, e.g. optimizing navigation strategies and controlling material properties of cellular tissues and bacterial aggregates. Despite this, the…
We study the first-passage time to the origin of a mortal Brownian particle, with mortality rate $ \mu $, diffusing in one dimension. The particle starts its motion from $ x>0 $ and it is subject to stochastic resetting with constant rate $…
Levy flights are known to be optimal search strategies in the particular case of revisitable targets. In the relevant situation of non revisitable targets, we propose an alternative model of bidimensional search processes, which explicitly…
Diffusing diffusivity models, polymers in the grand canonical ensemble and polydisperse, and continuous-time random walks all exhibit stages of non-Gaussian diffusion. Is non-Gaussian targeting more efficient than Gaussian? We address this…
We consider the dynamical evolution of a Brownian particle undergoing stochastic resetting, meaning that after random periods of time it is forced to return to the starting position. The intervals after which the random motion is stopped…
The time instant -- the first-passage time (FPT) -- when a diffusive particle (e.g., a ligand such as oxygen or a signalling protein) for the first time reaches an immobile target located on the surface of a bounded three-dimensional domain…
We investigate an intermittent stochastic process, in which the diffusive motion with time-dependent diffusion coefficient $D(t)\sim t^{\alpha-1}$, $\alpha>0$ (scaled Brownian motion), is stochastically reset to its initial position and…
Devising optimal interventions for constraining stochastic systems is a challenging endeavour that has to confront the interplay between randomness and nonlinearity. Existing methods for identifying the necessary dynamical adjustments…
We investigate a stochastic search process in one dimension under the competing roles of mortality, redundancy, and diversity of the searchers. This picture represents a toy model for the fertilization of an oocyte by sperm. A population of…
What is the fastest way of finding a randomly hidden target? This question of general relevance is of vital importance for foraging animals. Experimental observations reveal that the search behaviour of foragers is generally intermittent:…
Cover times quantify the speed of exhaustive search. In this work, we compute exactly the mean cover time associated with a one-dimensional Brownian search under exponentially distributed resetting. We also approximate the moments of cover…
In this paper we consider the diffusive search for a bounded target $\Omega \in \R^d$ with its boundary $\partial \Omega$ totally absorbing. We assume that the target is surrounded by a semipermeable interface given by the closed surface…