相关论文: Non-homogeneous random walks with stochastic reset…

We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…

We consider a continuous-time random walk which is the generalization, by means of the introduction of waiting periods on sites, of the one-dimensional nonhomogeneous random walk with a position-dependent drift known in the mathematical…

We investigate the first passage time beyond a barrier located at $b\geq0$ of a random walk with independent and identically distributed jumps, starting from $x_0=0$. The walk is subject to stochastic resetting, meaning that after each step…

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…

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…

In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…

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…

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 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…

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…

In many physical situations, there appears the problem of reaching a single target that is spatially distributed. Here we analyse how stochastic resetting, also spatially distributed, can be used to improve the search process when the…

The cost of stochastic resetting is considered within the context of a discrete random walk model. In addition to standard stochastic resetting, for which a reset occurs with a certain probability after \emph{each} step, we introduce a…

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…

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…

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…

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…

We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…

In the previous chapters, we explored the effects of resetting on networks considering one and two nodes. In this chapter, we will describe a generalization of random walks with resetting to an arbitrary number of nodes $\mathcal{M}$. In…

We study discrete-time random walks on networks subject to a time-dependent stochastic resetting, where the walker either hops randomly between neighboring nodes with a probability $1-\phi(a)$, or is reset to a given node with a…

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…