Related papers: Random search with stochastic resetting: when find…
This paper presents planning algorithms for a robotic manipulator with a fixed base in order to grasp a target object in cluttered environments. We consider a configuration of objects in a confined space with a high density so no…
The efficient placement of signal templates in source-parameter space is a crucial requisite for exhaustive matched-filtering searches of modeled gravitational-wave sources. Unfortunately, the current placement algorithms based on regular…
We study the positive occupation time of a run-and-tumble particle (RTP) subject to stochastic resetting. Under the resetting protocol, the position of the particle is reset to the origin at a random sequence of times that is generated by a…
This thesis develops exact analytical tools to study strongly correlated stochastic systems, with a focus on extreme value statistics, gap statistics, and full counting statistics in multi-particle processes. A central contribution is the…
State resetting is a fundamental but often overlooked capability of simulators. It supports sample-based planning by allowing resets to previously encountered simulation states, and enables calibration of simulators using real data by…
Randomized search algorithms for hard combinatorial problems exhibit a large variability of performances. We study the different types of rare events which occur in such out-of-equilibrium stochastic processes and we show how they cooperate…
We study stochastic resetting of a probe particle in a viscoelastic environment where only the probe is reset while the medium retains memory of its past dynamics. Using a minimal model with finite correlation time, we analyze the…
In this paper we consider the one-dimensional dynamical evolution of a particle traveling at constant speed and performing, at a given rate, random reversals of the velocity direction. The particle is subject to stochastic resetting,…
This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. We first show that intermittent…
The stochastic differential and integral equations describing the system of particles weakly interacting among themselves which are absorbed and scattered by particles of a medium are considered. The time-dependent transport equation with…
We study a Brownian particle diffusing under a time-modulated stochastic resetting mechanism to a fixed position. The rate of resetting r(t) is a function of the time t since the last reset event. We derive a sufficient condition on r(t)…
We consider the problem of the first passage time to the origin of a spatially non-homogeneous random walk with a position-dependent drift, known as the Gillis random walk, in the presence of resetting. The walk starts from an initial site…
Recent works have explored the properties of L\'evy flights with resetting in one-dimensional domains and have reported the existence of phase transitions in the phase space of parameters which minimizes the Mean First Passage Time (MFPT)…
The effect of refractory periods in partial resetting processes is studied. Under Poissonian partial resets, a state variable jumps to a value closer to the origin by a fixed fraction at constant rate, $x\to a x$. Following each reset, 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…
Stochastic resetting -- the intermittent restart of random processes -- has profoundly reshaped first-passage theory, providing a mechanism to control and optimize completion times. While the influence of resetting on mean first-passage…
We study the accumulation of resources within a target due to the interplay between continual delivery, driven by 1D stochastic search processes, and sequential consumption. The assumption of sequential consumption is key because it changes…
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…
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 consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes…