Related papers: Intermittent random walks under stochastic resetti…
Proper management of resources whose arrival and consumption are subject to environmental randomness is an intrinsic process in both natural and artificial systems. This phenomenon can be modeled as a queuing process whose arrival…
Stochastic resetting has emerged as a useful strategy to reduce the completion time for a broad class of first passage processes. In the canonical setup, one intermittently resets a given system to its initial configuration only to start…
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…
We investigate the role of stochastic resetting in non-Markovian systems, where memory effects arise due to slow relaxation, rugged energy landscapes, disordered environments, and molecular crowding. Using the celebrated continuous-time…
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…
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…
In this paper we introduce a general stochastic representation for an important class of processes with resetting. It allows to describe any stochastic process intermittently terminated and restarted from a predefined random or non-random…
The strategy of stochastic resetting is known to expedite the first passage to a target, in diffusive systems. Consequently, the mean first passage time is minimized at an optimal resetting parameter. With Poisson resetting, vanishing…
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…
In the classical stochastic resetting problem, a particle, moving according to some stochastic dynamics, undergoes random interruptions that bring it to a selected domain, and then, the process recommences. Hitherto, the resetting mechanism…
The first hitting times of a stochastic process, i.e., the first time a process reaches a particular level, are of significant interest across various scientific disciplines, including biology, chemistry, and economics. We modify the…
In this paper we consider a stochastic process that may experience random reset events which bring suddenly the system to the starting value and analyze the relevant statistical magnitudes. We focus our attention on monotonous…
Will the strategy of resetting} help a stochastic process to reach its target efficiently, with its environment continually toggling between a strongly favourable and an unfavourable (or weakly favourable) state? A diffusive run-and-tumble…
Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…
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 study the dynamics of a deterministic walk confined in a narrow two-dimensional space randomly filled with point-like targets. At each step, the walker visits the nearest target not previously visited. Complex dynamics is observed at…
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$…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
A new model of search based on stochastic resetting is introduced, wherein rate of resets depends explicitly on time elapsed since the beginning of the process. It is shown that rate inversely proportional to time leads to paradoxical…
We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…