Related papers: Target search kinetics for random walkers with mem…
We use a lattice model to study first-passage time distributions of target finding events through complex environments with elongated fibers distributed with different anisotropies and volume occupation fractions. For isotropic systems and…
We analyze predator-prey dynamics in one dimension in which a Brownian predator adopts a chasing strategy that consists in stochastically resetting its current position to locations previously visited by a diffusive prey. We study three…
We consider an anisotropic needle-like Brownian particle with nematic symmetry confined in a $2D$ domain. For this system, the coupling of translational and rotational diffusion makes the process ${\bf x} (t)$ of the positions of the…
The quantum first-detection problem concerns the statistics of the time at which a system, subject to repeated measurements, is observed in a prescribed target state for the first time. Unlike its classical counterpart, the measurement back…
We consider a continuous-time random walk model with finite-mean waiting-times and we study the mean first-passage time (MFPT) as estimated by an observer in a reference frame $\mathcal{S}$, that is co-moving with a target, and by an…
We propose an approach for estimating the probability that a given small target, among many, will be the first to be reached in a molecular dynamics simulation. Reaching small targets out of a vast number of possible configurations…
Motivated by the diffusion-reaction kinetics on interstellar dust grains, we study a first-passage problem of mortal random walkers in a confined two-dimensional geometry. We provide an exact expression for the encounter probability of two…
We consider a walker moving in a one-dimensional interval with absorbing boundaries under the effect of Markovian resettings to the initial position. The walker's motion follows a random walk characterized by a general waiting time…
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 use a first-passage time approach to study the statistics of the trapping times induced by persistent motion of active particles colliding with flat boundaries. The angular first-passage time distribution and mean first-passage time is…
We obtain non-Gaussian limit laws for one-dimensional random walk in a random environment assuming that the environment is a function of a stationary Markov process. This is an extension of the work of Kesten, M. Kozlov and Spitzer for…
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…
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…
Gated first-passage processes, where completion depends on both hitting a target and satisfying additional constraints, are prevalent across various fields. Despite their significance, analytical solutions to basic problems remain unknown,…
We consider the problem of bounding mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents. The quantitative analysis of such probabilistic population…
This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. We first show that intermittent…
We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…
Efficient search acts as a strong selective force in biological systems ranging from cellular populations to predator-prey systems. The search processes commonly involve finding a stationary or mobile target within a heterogeneously…
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…
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…