Related papers: First Passage with Restart in Discrete Time: with …
First passage under restart has recently emerged as a conceptual framework to study various stochastic processes under restart mechanism. Emanating from the canonical diffusion problem by Evans and Majumdar, restart has been shown to…
First Passage (FP) processes are utilized widely to model phenomena in many areas of mathematical applications, from biology to computer science. Introducing a mechanism to restart the parent process can alter the first passage…
Restart -- interrupting a stochastic process followed by a new start -- is known to improve the mean time to its completion, and the general conditions under which such an improvement is achieved are now well understood. Here, we explore…
Recently noticed ability of restart to reduce the expected completion time of first-passage processes allows appealing opportunities for performance improvement in a variety of settings. However, complex stochastic processes often exhibit…
In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…
We consider the dynamics of lattice random walks with resetting. The walker moving randomly on a lattice of arbitrary dimensions resets at every time step to a given site with a constant probability $r$. We construct a discrete renewal…
We revisit the simple lattice random walk (P\'{o}lya walk) and the Sisyphus random walk in $\mathbb{Z}$, in the presence of random restarts. We use a relatively direct approach namely First passage under restart for discrete space and time…
We determine the full distribution and moments of the first passage time for a wide class of stochastic search processes in the limit of frequent stochastic resetting. Our results apply to any system whose short-time behavior of the search…
We study random walks with stochastic resetting to the initial position on arbitrary networks. We obtain the stationary probability distribution as well as the mean and global first passage times, which allow us to characterize the effect…
First-passage properties are central to the kinetics of target-search processes. Theoretical approaches so far primarily focused on predicting first-passage statistics for a given process or model. In practice, however, one faces the…
Stochastic restarting is a strategy of starting anew. Incorporation of the resetting to the random walks can result in the decrease of the mean first passage time, due to the ability to limit unfavorably meandering, sub-optimal…
First passage of stochastic processes under resetting has recently been an active research topic in the field of statistical physics. However, most of previous studies mainly focused on the systems with continuous time and space. In this…
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…
Stochastic restart may drastically reduce the expected run time of a computer algorithm, expedite the completion of a complex search process, or increase the turnover rate of an enzymatic reaction. These diverse first-passage-time (FPT)…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which…
First passage under restart with branching is proposed as a generalization of first passage under restart. Strong motivation to study this generalization comes from the observation that restart with branching can expedite the completion of…
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…
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
Optimization of a random processes by restart is a subject of active theoretical research in statistical physics and has long found practical application in computer science. Meanwhile, one of the key issues remains largely unsolved: when…