Related papers: Intermittent random walks under stochastic resetti…
Designing navigation strategies for search time optimization remains of interest in various interdisciplinary branches in science. In here, we focus on microscopic self-propelled searchers namely active Brownian walkers in noisy and…
We consider biased random walks on random networks constituted by a random comb comprising a backbone with quenched-disordered random-length branches. The backbone and the branches run in the direction of the bias. For the bare model as…
We replicate a renewal process at random times, which is equivalent to nesting two renewal processes, or considering a renewal process subject to stochastic resetting. We investigate the consequences on the statistical properties of the…
We consider three kinds of discrete-time arrival processes: transient, intermediate and recurrent, characterized by a finite, possibly finite and infinite number of events, respectively. In this context, we study renewal processes which are…
Intermittent stochastic processes appear in a wide field, such as chemistry, biology, ecology, and computer science. This paper builds up the theory of intermittent continuous time random walk (CTRW) and L\'{e}vy walk, in which the…
The state of many physical, biological and socio-technical systems evolves by combining smooth local transitions and abrupt resetting events to a set of reference values. The inclusion of the resetting mechanism not only provides the…
The escape of the randomly accelerated undamped particle from the finite interval under action of stochastic resetting is studied. The motion of such a particle is described by the full Langevin equation and the particle is characterized by…
We derive the characteristic function of stochastic functionals of a random walk whose position is reset to the origin at random times drawn from a general probability distribution. We analyze the long-time behavior and obtain the temporal…
We consider a random walker on a ring, subjected to resetting at Poisson-distributed times to the initial position (the walker takes the shortest path along the ring to the initial position at resetting times). In the case of a Brownian…
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…
The random walk process in a nonhomogeneous medium, characterised by a L\'evy stable distribution of jump length, is discussed. The width depends on a position: either before the jump or after that. In the latter case, the density slope is…
Consider a branching random walk evolving in a macroscopic time-inhomogeneous environment, that scales with the length $n$ of the process under study. We compute the first two terms of the asymptotic of the maximal displacement at time $n$.…
We consider a one-dimensional search process under stochastic resetting conditions. A target is located at $b\geq0$ and a searcher, starting from the origin, performs a discrete-time random walk with independent jumps drawn from a…
Consider a stochastic search model with resetting for an unknown stationary target $a\in\mathbb{R}$ with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion constant $D$. The searcher is…
Resetting has been shown to reduce the completion time for a stochastic process, such as the first passage time for a diffusive searcher to find a target. The time between two consecutive resetting events is drawn from a waiting time…
We consider random walks in dynamic random environments given by Markovian dynamics on $\mathbb{Z}^d$. We assume that the environment has a stationary distribution $\mu$ and satisfies the Poincar\'e inequality w.r.t. $\mu$. The random walk…
We consider a ballistic random walk in an i.i.d. random environment that does not allow retreating in a certain fixed direction. Homogenization and regeneration techniques combine to prove a law of large numbers and an averaged invariance…
We study how stochastic resetting affects first-passage processes in systems of many interacting particles. While resetting is well understood for single-particle dynamics, its consequences for collective behavior remain less clear. We…
The transport properties of discrete-time random walks on ring networks with deterministic shortcuts are investigated through analytical and numerical methods. The network consists of a periodic chain where each node is connected to its…
Restarting a stochastic search process can accelerate its completion by providing an opportunity to take a more favorable path with each reset. This strategy, known as stochastic resetting, is well studied in random processes. Here, we…