Related papers: Optimizing persistent random searches
The run-and-tumble walk, consisting in randomly reoriented ballistic excursions, models phenomena ranging from gas kinetics to bacteria motility. We evaluate the mean time required for this walk to find a fixed target within a 2D or 3D…
We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest…
We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…
We consider a problem of finding a target located in a finite $d$-dimensional domain, using $N$ independent random walkers, when partial information on the target location is given as a probability distribution. When $N$ is large, the…
In many random search processes of interest in chemistry, biology or during rescue operations, an entity must find a specific target site before the latter becomes inactive, no longer available for reaction or lost. We present exact results…
In this chapter, we consider the problem of a non-Markovian random walker (displaying memory effects) searching for a target. We review an approach that links the first passage statistics to the properties of trajectories followed by the…
Finding a target in a complex environment is a fundamental challenge in nature, from chemical reactions to sperm reaching an egg. An effective strategy to reduce the time needed to reach a target is to deploy many searchers, increasing the…
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…
We study the search kinetics of an immobile target by a concentration of randomly moving searchers. The object of the study is to optimize the probability of detection within the constraints of our model. The target is hidden on a…
An efficient searcher needs to balance properly the tradeoff between the exploration of new spatial areas and the exploitation of nearby resources, an idea which is at the core of scale-free L\'evy search strategies. Here we study…
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…
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:…
Efficient search acts as a strong selective force in biological systems ranging from cellular populations to predator-prey systems. The search processes commonly involve finding a stationary or mobile target within a heterogeneously…
Autonomous robots are commonly tasked with the problem of area exploration and search for certain targets or artifacts of interest to be tracked. Traditionally, the problem formulation considered is that of complete search and thus -…
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…
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…
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…
How long does it take a random searcher to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not…
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…