相关论文: Optimal non-Markovian search strategies with n-ste…

First passage time plays a fundamental role in dynamical characterization of stochastic processes. Crucially, our current understanding on the problem is almost entirely relies on the theoretical formulations, which assume the processes…

The mean first-passage time (MFPT) is one standard measure for the reaction time in thermally activated barrier-crossing processes. While the relationship between MFPTs and phenomenological rate coefficients is known for systems that…

In this paper, we analyze the mean first passage time (MFPT) for a single Brownian particle to find a stochastically-gated target under the additional condition that the position of the particle is reset to a fixed position $\x_r$ at a rate…

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…

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…

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

We consider one dimensional diffusive search strategies subjected to external potentials. The location of a single target is drawn from a given probability density function (PDF) $f_G(x)$ and is fixed for each stochastic realization of the…

We study a one-dimensional random walk with memory in which the step lengths to the left and to the right evolve at each step in order to reduce the wandering of the walker. The feedback is quite efficient and lead to a non-diffusive walk.…

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

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…

In many situations, simply finding a target during a search is not enough. It is equally important to be able to return to that target repeatedly or to enable a larger community to locate and utilize it. While first passage time is commonly…

We introduce a non-equilibrium discrete-time random walk model on multiplex networks, in which at each time step the walker first undergoes a random jump between neighboring nodes in the same layer, and then tries to hop from one node to…

We investigate the effects of markovian resseting events on continuous time random walks where the waiting times and the jump lengths are random variables distributed according to power law probability density functions. We prove the…

We study first-passage time problems for a diffusive particle with stochastic resetting with a finite rate $r$. The optimal search time is compared quantitatively with that of an effective equilibrium Langevin process with the same…

What is the fastest way of finding a randomly hidden target? This question of general relevance is of vital importance for foraging animals. Experimental observations reveal that the search behaviour of foragers is generally intermittent:…

A new mechanism for efficiently solving the Markov decision processes (MDPs) is proposed in this paper. We introduce the notion of reachability landscape where we use the Mean First Passage Time (MFPT) as a means to characterize the…

We study quantum algorithms for spatial search on finite dimensional grids. Patel et al. and Falk have proposed algorithms based on a quantum walk without a coin, with different operators applied at even and odd steps. Until now, such…

The discrete stochastic dynamics of a random walker in the presence of resetting and memory is analyzed. Resetting and memory effects may compete for certain parameter regime and lead to significant changes in the long time dynamics of the…

Milestoning is a computational procedure that reduces the dynamics of complex systems to memoryless jumps between intermediates, or milestones, and only retains some information about the probability of these jumps and the time lags between…

For many stochastic dynamic systems, the Mean First Passage Time (MFPT) is a useful concept, which gives expected time before a state of interest. This work is an extension of MFPT in several ways. (1) We show that for some systems the…