Related papers: Random search with stochastic resetting: when find…
In this work we consider a stochastic movement process with random resets to the origin followed by a random residence time there before the walker restarts its motion. First, we study the transport properties of the walker, we derive an…
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…
We consider the problem of diffusion with stochastic resetting in a population of random walks where the diffusion coefficient is not constant, but behaves as a power-law of the average resetting rate of the population. Resetting occurs…
The theory of stochastic resetting asserts that restarting a stochastic process can expedite its completion. In this paper, we study the escape process of a Brownian particle in an open Hamiltonian system that suffers noise-enhanced…
In this paper, we propose a stochastic search algorithm for solving general optimization problems with little structure. The algorithm iteratively finds high quality solutions by randomly sampling candidate solutions from a parameterized…
We study experimentally and theoretically the optimal mean time needed by a free diffusing Brownian particle to reach a target at a distance L from an initial position in the presence of resetting. Both the initial position and the…
In this chapter, we review our recent work on first passage time (FPT) problems for absorption by a target whose interface is semipermeable. For pedagogical reasons, we focus on a single Brownian particle searching for a single target in a…
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$…
Consider a team of agents in the plane searching for and visiting target points that appear in a bounded environment according to a stochastic renewal process with a known absolutely continuous spatial distribution. Agents must detect…
We study a multi-objective model on the allocation of reusable resources under model uncertainty. Heterogeneous customers arrive sequentially according to a latent stochastic process, request for certain amounts of resources, and occupy…
Identifying optimal strategies for efficient spatial exploration is crucial, both for animals seeking food and for robotic search processes, where maximizing the covered area is a fundamental requirement. Here, we propose position resetting…
The first passage search of a diffusing target (prey) by multiple searchers (predators) in confinement is an important problem in the stochastic process literature. While the analogous problem in open space has been studied in some details,…
We analyze the efficiency of parallelization and restart mechanisms for stochastic simulations in model-free settings, where the underlying system dynamics are unknown. Such settings are common in Reinforcement Learning (RL) and rare event…
Motivated by programmatic advertising optimization, we consider the task of sequentially allocating budget across a set of resources. At every time step, a feasible allocation is chosen and only a corresponding random return is observed.…
Stochastic resetting is a driving mechanism that is known to minimize the first passage time to reach a target, at the cost of energy expenditure. The choice of the physical implementation of each resetting event determines the tradeoff…
Resetting a stochastic process is an important problem describing the evolution of physical, biological and other systems which are continually returned to their certain fixed point. We consider the motion of a subdiffusive particle with a…
We explore the effect of stochastic resetting on the first-passage properties of Feller process. The Feller process can be envisioned as space-dependent diffusion, with diffusion coefficient $D(x)=x$, in a potential…
Stochastic resets have lately emerged as a mechanism able to generate finite equilibrium mean square displacement (MSD) when they are applied to diffusive motion. Furthermore, walkers with an infinite mean first arrival time (MFAT) to a…
We solve an adaptive search model where a random walker or L\'evy flight stochastically resets to previously visited sites on a $d$-dimensional lattice containing one trapping site. Due to reinforcement, a phase transition occurs when the…
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…