相关论文: Target search kinetics for random walkers with mem…

To overcome some limits of classical neuronal models, we propose a Markovian generalization of the classical model based on Jacobi processes by introducing downwards jumps to describe the activity of a single neuron. The statistical…

We consider a Markovian jumping process with two absorbing barriers, for which the waiting-time distribution involves a position-dependent coefficient. We solve the Fokker-Planck equation with boundary conditions and calculate the mean…

We investigate the first-passage properties of bursty random walks on a finite one-dimensional interval of length L, in which unit-length steps to the left occur with probability close to one, while steps of length b to the right --…

We derive a functional equation for the mean first-passage time (MFPT) of a generic self-similar Markovian continuous process to a target in a one-dimensional domain and obtain its exact solution. We show that the obtained expression of the…

Many transport processes in ecology, physics and biochemistry can be described by the average time to first find a site or exit a region, starting from an initial position. Typical mathematical treatments are based on formulations that…

We introduce a general framework, applicable to a broad class of random walks on networks, that quantifies the response of the mean first-passage time to a target node to a local perturbation of the network, both in the context of attacks…

We introduce history-dependent discrete-time quantum random walk models by adding uncorrelated memory terms and also by modifying Hamiltonian of the walker to include couplings with memory-keeping agents. We next numerically study the…

We study the occupation time statistics for non-Markovian random walkers based on the formalism of the generalized master equation for the Continuous-Time Random Walk. We also explore the case when the random walker additionally undergoes a…

First-passage times in random walks have a vast number of diverse applications in physics, chemistry, biology, and finance. In general, environmental conditions for a stochastic process are not constant on the time scale of the average…

The time it takes the fastest searcher out of $N\gg1$ searchers to find a target determines the timescale of many physical, chemical, and biological processes. This time is called an extreme first passage time (FPT) and is typically much…

Finding the best strategy to minimize the time needed to find a given target is a crucial task both in nature and in reaching decisive technological advances. By considering learning agents able to switch their dynamics between standard and…

We consider $N$ Brownian motions diffusing independently on a line, starting at $x_0>0$, in the presence of an absorbing target at the origin. The walkers undergo stochastic resetting under two protocols: (A) each walker resets…

We investigate the mean first passage time of an active Brownian particle in one dimension using numerical simulations. The activity in one dimension is modeled as a two state model; the particle moves with a constant propulsion strength…

We study analytically an intermittent search process in one dimension. There is an immobile target at the origin and a searcher undergoes a discrete time jump process starting at $x_0\geq0$, where successive jumps are drawn independently…

In this tutorial, which contains some original results, we bridge the fields of quantum computing algorithms, conservation laws, and many-body quantum systems by examining three algorithms for searching an unordered database of size $N$…

In noisy environments such as the cell, many processes involve target sites that are often hidden or inactive, and thus not always available for reaction with diffusing entities. To understand reaction kinetics in these situations, we study…

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

In this paper we consider a random search process with stochastic resetting and a partially accessible target $\calU$. That is, when the searcher finds the target by attaching to its surface $\partial \calU$ it does not have immediate…

A class of algorithms in discrete space and continuous time for Brownian first passage time estimation is considered. A simple algorithm is derived that yields exact mean first passage times (MFPT) for linear potentials in one dimension,…

In this paper, we conduct a literature review of laws of motion based on stochastic search strategies which are mainly focused on exploring highly dynamic environments. In this regard, stochastic search strategies represent an interesting…