Related papers: Optimal potentials for diffusive search strategies
By periodically returning a search process to a known or random state, random resetting possesses the potential to unveil new trajectories, sidestep potential obstacles, and consequently enhance the efficiency of locating desired targets.…
We analyze velocity-jump process models of persistent search for a single target on a bounded domain. The searcher proceeds along ballistic trajectories and is absorbed upon collision with the target boundary. When reaching the domain…
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$…
The transport properties of discrete-time random walks on ring networks with deterministic shortcuts are investigated through analytical and numerical methods. The network consists of a periodic chain where each node is connected to its…
Efficiency of search for randomly distributed targets is a prominent problem in many branches of the sciences. For the stochastic process of L\'evy walks, a specific range of optimal efficiencies was suggested under variation of search…
Diffusive search for a static target is a common problem in statistical physics with numerous applications in chemistry and biology. We look at this problem from a different perspective and investigate the statistics of encounters between…
In this work we consider the problem of searches that utilises past information gathered during searching, to evaluate the probability distribution of finding the source at each step. We start with a sample strategy where the movement at…
We investigate a stochastic search process in one, two, and three dimensions in which $N$ diffusing searchers that all start at $x_0$ seek a target at the origin. Each of the searchers is also reset to its starting point, either with rate…
We investigate classic diffusion with the added feature that a diffusing particle is reset to its starting point each time the particle reaches a specified threshold. In an infinite domain, this process is non-stationary and its probability…
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 study the effect of a resetting point randomly distributed around the origin on the mean first passage time of a Brownian searcher moving in one dimension. We compare the search efficiency with that corresponding to reset to the origin…
We address the problem of minimizing the expected first-passage time of a Brownian motion with Poissonian resetting, with respect to the resetting rate $r.$ We consider both the one-boundary and the two-boundary cases.We investigate the…
Diffusion with an incorporated resetting mechanism provides a reference framework for modeling a wide range of natural phenomena. Within this framework, the optimal resetting rate is a key quantity that arises from the optimization of the…
A random search is a stochastic process representing the random motion of a particle (denoted as the searcher) that is terminated when it reaches (detects) a target particle or area the first time. In intermittent search the random motion…
Many physical phenomena are modeled as stochastic searchers looking for targets. In these models, the probability that a searcher finds a particular target, its so-called hitting probability, is often of considerable interest. In this work…
A common scenario in a variety of biological systems is that multiple particles are searching in parallel for an immobile target located in a bounded domain, and the fastest among them that arrives to the target first triggers a given…
Diffusion on complex networks is often modeled as a stochastic process. Yet, recent work on strategic diffusion emphasizes the decision power of agents and treats diffusion as a strategic problem. Here we study the computational aspects of…
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…
First passage in a stochastic process may be influenced by the presence of an external confining potential, as well as "stochastic resetting" in which the process is repeatedly reset back to its initial position. Here we study the interplay…
We introduce \emph{proxitaxis}, a simple search strategy where the searcher has only information about the distance from the target but not the direction. The strategy consists of three crucial components: (i) local adaptive moves with…