First Passage under Restart

First-passage times under frequent stochastic resetting

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 process without resetting can be estimated. In addition to the typical case of exponentially distributed resetting times, we prove our results for a variety of resetting time distributions. We illustrate our results in several examples and show that the errors of our approximations vanish exponentially fast in typical scenarios of diffusive search.

Autonomous ratcheting by stochastic resetting

We propose a generalization of the stochastic resetting mechanism for a Brownian particle diffusing in a one-dimensional periodic potential: randomly in time, the particle gets reset at the bottom of the potential well it was in. Numerical simulations show that in mirror asymmetric potentials, stochastic resetting rectifies the particle's dynamics, with a maximum drift speed for an optimal average resetting time. Accordingly, an unbiased Brownian tracer diffusing on an asymmetric substrate can rectify its motion by adopting an adaptive stop-and-go strategy. Our proposed ratchet mechanism can model the directed autonomous motion of molecular motors and micro-organisms.

Fluid-Solid Reaction in Porous Media as a Chaotic Restart Process

Chemical and biological reactions at fluid-solid interfaces are central to a broad range of porous material applications and research. Pore-scale solute transport limitations can reduce reaction rates, with marked consequences for a wide spectrum of natural and engineered processes. Recent advances show that chaotic mixing occurs spontaneously in porous media, but its impact on surface reactions is unknown. We show that pore-scale chaotic mixing significantly increases reaction efficiency compared to nonchaotic flows. We find that reaction rates are well described in terms of diffusive first-passage times of reactants to the solid interface subjected to a stochastic restart process resulting from Lagrangian chaos. Under chaotic mixing, the shear layer at no-slip interfaces sets the restart rate and leads to a characteristic scaling of reaction efficiency with Péclet number, in excellent agreement with numerical simulations. Reaction rates are insensitive to the flow topology as long as flow is chaotic, suggesting the relevance of this process to a broad range of porous materials.

Critical number of walkers for diffusive search processes with resetting

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 independently to x_{0} with rate r and (B) all walkers reset simultaneously to x_{0} with rate r. We derive an explicit analytical expression for the mean first-passage time to the origin in terms of an integral which is evaluated numerically using Mathematica. We show that, as a function of r and for fixed x_{0}, it has a minimum at an optimal value r^{*}>0 as long as N<N_{c}. Thus resetting is beneficial for the search for N<N_{c}. When N>N_{c}, the optimal value occurs at r^{*}=0 indicating that resetting hinders search processes. We obtain different values of N_{c} for protocols A and B; indeed, for N≤7 resetting is beneficial in protocol A, while for N≤6 resetting is beneficial for protocol B. Our theoretical predictions are verified in numerical Langevin simulations.

Resetting induced multimodality

Properties of stochastic systems are defined by the noise type and deterministic forces acting on the system. In out-of-equilibrium setups, e.g., for motions under action of Lévy noises, the existence of the stationary state is not only determined by the potential but also by the noise. Potential wells need to be steeper than parabolic in order to assure the existence of stationary states. The existence of stationary states, in sub-harmonic potential wells, can be restored by stochastic resetting, which is the protocol of starting over at random times. Herein, we demonstrate that the combined action of Lévy noise and Poissonian stochastic resetting can result in the phase transition between non-equilibrium stationary states of various multimodality in the overdamped system in super-harmonic potentials. Fine-tuned resetting rates can increase the modality of stationary states, while for high resetting rates, the multimodality is destroyed as the stochastic resetting limits the spread of particles.

Universal performance bounds of restart

As has long been known to computer scientists, the performance of probabilistic algorithms characterized by relatively large runtime fluctuations can be improved by applying a restart, i.e., episodic interruption of a randomized computational procedure followed by initialization of its new statistically independent realization. A similar effect of restart-induced process acceleration could potentially be possible in the context of enzymatic reactions, where dissociation of the enzyme-substrate intermediate corresponds to restarting the catalytic step of the reaction. To date, a significant number of analytical results have been obtained in physics and computer science regarding the effect of restart on the completion time statistics in various model problems, however, the fundamental limits of restart efficiency remain unknown. Here we derive a range of universal statistical inequalities that offer constraints on the effect that restart could impose on the completion time of a generic stochastic process. The corresponding bounds are expressed via simple statistical metrics of the original process such as harmonic mean h, median value m, and mode M, and, thus, are remarkably practical. We test our analytical predictions with multiple numerical examples, discuss implications arising from them and important avenues of future work.

Extreme Statistics and Spacing Distribution in a Brownian Gas Correlated by Resetting

We study a one-dimensional gas of N Brownian particles that diffuse independently, but are simultaneously reset to the origin at a constant rate r. The system approaches a nonequilibrium stationary state with long-range interactions induced by the simultaneous resetting. Despite the presence of strong correlations, we show that several observables can be computed exactly, which include the global average density, the distribution of the position of the kth rightmost particle, and the spacing distribution between two successive particles. Our analytical results are confirmed by numerical simulations. We also discuss a possible experimental realization of this resetting gas using optical traps.

Universal Framework for Record Ages under Restart

We propose a universal framework to compute record age statistics of a stochastic time series that undergoes random restarts. The proposed framework makes minimal assumptions on the underlying process and is furthermore suited to treat generic restart protocols going beyond the Markovian setting. After benchmarking the framework for classical random walks on the 1D lattice, we derive a universal criterion underpinning the impact of restart on the age of the nth record for generic time series with nearest-neighbor transitions. Crucially, the criterion contains a penalty of order n that puts strong constraints on restart expediting the creation of records, as compared to the simple first-passage completion. The applicability of our approach is further demonstrated on an aggregation-shattering process where we compute the typical growth rates of aggregate sizes. This unified framework paves the way to explore record statistics of time series under restart in a wide range of complex systems.

Imperfect narrow escape problem

We consider the kinetics of the imperfect narrow escape problem, i.e., the time it takes for a particle diffusing in a confined medium of generic shape to reach and to be adsorbed by a small, imperfectly reactive patch embedded in the boundary of the domain, in two or three dimensions. Imperfect reactivity is modeled by an intrinsic surface reactivity κ of the patch, giving rise to Robin boundary conditions. We present a formalism to calculate the exact asymptotics of the mean reaction time in the limit of large volume of the confining domain. We obtain exact explicit results in the two limits of large and small reactivities of the reactive patch, and a semianalytical expression in the general case. Our approach reveals an anomalous scaling of the mean reaction time as the inverse square root of the reactivity in the large-reactivity limit, valid for an initial position near the extremity of the reactive patch. We compare our exact results with those obtained within the "constant flux approximation"; we show that this approximation turns out to give exactly the next-to-leading-order term of the small-reactivity limit, and provides a good approximation of the reaction time far from the reactive patch for all reactivities, but not in the vicinity of the boundary of the reactive patch due to the above-mentioned anomalous scaling. These results thus provide a general framework to quantify the mean reaction times for the imperfect narrow escape problem.

Linear Response and Fluctuation-Dissipation Relations for Brownian Motion under Resetting

We consider fluctuation-dissipation relations (FDRs) for a Brownian motion under renewal resetting with arbitrary waiting time distribution between the resetting events. We show that if the distribution of waiting times of the resetting process possesses the second moment, the usual (generalized) FDR and the equivalent generalized Einstein's relation (GER) apply for the response function of the coordinate. If the second moment of waiting times diverges but the first one stays finite, the static susceptibility diverges, the usual FDR breaks down, but the GER still applies. In any of these situations, the fluctuation dissipation relations define the effective temperature of the system which is twice as high as the temperature of the medium in which the Brownian motion takes place.

Fick-Jacobs description and first passage dynamics for diffusion in a channel under stochastic resetting

The transport of particles through channels is of paramount importance in physics, chemistry, and surface science due to its broad real world applications. Much insight can be gained by observing the transition paths of a particle through a channel and collecting statistics on the lifetimes in the channel or the escape probabilities from the channel. In this paper, we consider the diffusive transport through a narrow conical channel of a Brownian particle subject to intermittent dynamics, namely, stochastic resetting. As such, resetting brings the particle back to a desired location from where it resumes its diffusive phase. To this end, we extend the Fick-Jacobs theory of channel-facilitated diffusive transport to resetting-induced transport. Exact expressions for the conditional mean first passage times, escape probabilities, and the total average lifetime in the channel are obtained, and their behavior as a function of the resetting rate is highlighted. It is shown that resetting can expedite the transport through the channel-rigorous constraints for such conditions are then illustrated. Furthermore, we observe that a carefully chosen resetting rate can render the average lifetime of the particle inside the channel minimal. Interestingly, the optimal rate undergoes continuous and discontinuous transitions as some relevant system parameters are varied. The validity of our one-dimensional analysis and the corresponding theoretical predictions is supported by three-dimensional Brownian dynamics simulations. We thus believe that resetting can be useful to facilitate particle transport across biological membranes-a phenomenon that can spearhead further theoretical and experimental studies.

Random Walks on Networks with Centrality-Based Stochastic Resetting

We introduce a refined way to diffusely explore complex networks with stochastic resetting where the resetting site is derived from node centrality measures. This approach differs from previous ones, since it not only allows the random walker with a certain probability to jump from the current node to a deliberately chosen resetting node, rather it enables the walker to jump to the node that can reach all other nodes faster. Following this strategy, we consider the resetting site to be the geometric center, the node that minimizes the average travel time to all the other nodes. Using the established Markov chain theory, we calculate the Global Mean First Passage Time (GMFPT) to determine the search performance of the random walk with resetting for different resetting node candidates individually. Furthermore, we compare which nodes are better resetting node sites by comparing the GMFPT for each node. We study this approach for different topologies of generic and real-life networks. We show that, for directed networks extracted for real-life relationships, this centrality focused resetting can improve the search to a greater extent than for the generated undirected networks. This resetting to the center advocated here can minimize the average travel time to all other nodes in real networks as well. We also present a relationship between the longest shortest path (the diameter), the average node degree and the GMFPT when the starting node is the center. We show that, for undirected scale-free networks, stochastic resetting is effective only for networks that are extremely sparse with tree-like structures as they have larger diameters and smaller average node degrees. For directed networks, the resetting is beneficial even for networks that have loops. The numerical results are confirmed by analytic solutions. Our study demonstrates that the proposed random walk approach with resetting based on centrality measures reduces the memoryless search time for targets in the examined network topologies.

Restart Expedites Quantum Walk Hitting Times

Classical first-passage times under restart are used in a wide variety of models, yet the quantum version of the problem still misses key concepts. We study the quantum hitting time with restart using a monitored quantum walk. The restart strategy eliminates the problem of dark states, i.e., cases where the particle evades detection, while maintaining the ballistic propagation which is important for a fast search. We find profound effects of quantum oscillations on the restart problem, namely, a type of instability of the mean detection time, and optimal restart times that form staircases, with sudden drops as the rate of sampling is modified. In the absence of restart and in the Zeno limit, the detection of the walker is not possible, and we examine how restart overcomes this well-known problem, showing that the optimal restart time becomes insensitive to the sampling period.

Effects of mortality on stochastic search processes with resetting

We study the first-passage time to the origin of a mortal Brownian particle, with mortality rate μ, diffusing in one dimension. The particle starts its motion from x>0 and it is subject to stochastic resetting with constant rate r. We first unveil the relation between the probability of reaching the target and the mean first-passage time of the corresponding problem in absence of mortality, which allows us to deduce under which conditions the former can be increased by adjusting the restart rate. We then consider the first-passage time conditioned on the event that the particle reaches the target before dying, and provide exact expressions for the mean and the variance as functions of r, corroborated by numerical simulations. By studying the impact of resetting for different mortality regimes, we also show that, if the average lifetime τ_{μ}=1/μ is long enough with respect to the diffusive time scale τ_{D}=x^{2}/(4D), there exist both a resetting rate r_{μ}^{*} that maximizes the probability and a rate r_{m} that minimizes the mean first-passage time. However, the two never coincide for positive μ, making the optimization problem highly nontrivial.

Narrow Pore Crossing of Active Particles under Stochastic Resetting

We propose a two-dimensional model of biochemical activation process, whereby self-propelling particles of finite correlation times are injected at the center of a circular cavity with constant rate equal to the inverse of their lifetime; activation is triggered when one such particle hits a receptor on the cavity boundary, modeled as a narrow pore. We numerically investigated this process by computing the particle mean-first exit times through the cavity pore as a function of the correlation and injection time constants. Due to the breach of the circular symmetry associated with the positioning of the receptor, the exit times may depend on the orientation of the self-propelling velocity at injection. Stochastic resetting appears to favor activation for large particle correlation times, where most of the underlying diffusion process occurs at the cavity boundary.

Stochastic Resetting for Enhanced Sampling

We present a method for enhanced sampling of molecular dynamics simulations using stochastic resetting. Various phenomena, ranging from crystal nucleation to protein folding, occur on time scales that are unreachable in standard simulations. They are often characterized by broad transition time distributions, in which extremely slow events have a non-negligible probability. Stochastic resetting, i.e., restarting simulations at random times, was recently shown to significantly expedite processes that follow such distributions. Here, we employ resetting for enhanced sampling of molecular simulations for the first time. We show that it accelerates long time scale processes by up to an order of magnitude in examples ranging from simple models to a molecular system. Most importantly, we recover the mean transition time without resetting, which is typically too long to be sampled directly, from accelerated simulations at a single restart rate. Stochastic resetting can be used as a standalone method or combined with other sampling algorithms to further accelerate simulations.

Capture of a diffusing lamb by a diffusing lion when both return home

A diffusing lion pursues a diffusing lamb when both of them are allowed to get back to their homes intermittently. Identifying the system with a pair of vicious random walkers, we study their dynamics under Poissonian and sharp resetting. In the absence of any resets, the location of intersection of the two walkers follows a Cauchy distribution. In the presence of resetting, the distribution of the location of annihilation is composed of two parts: one in which the trajectories cross without being reset (center) and the other where trajectories are reset at least once before they cross each other (tails). We find that the tail part decays exponentially for both the resetting protocols. The central part of the distribution, on the other hand, depends on the nature of the restart protocol, with Cauchy for Poisson resetting and Gaussian for sharp resetting. We find good agreement of the analytical results with numerical calculations.

Entropy rate of random walks on complex networks under stochastic resetting

Stochastic processes under resetting at random times have attracted a lot of attention in recent years and served as illustrations of nontrivial and interesting static and dynamic features of stochastic dynamics. In this paper, we aim to address how the entropy rate is affected by stochastic resetting in discrete-time Markovian processes, and we explore nontrivial effects of the resetting in the mixing properties of a stochastic process. In particular, we consider resetting random walks (RRWs) with a single resetting node on three different types of networks: degree-regular random networks, a finite-size Cayley tree, and a Barabási-Albert (BA) scale-free network, and we compute the entropy rate as a function of the resetting probability γ. Interestingly, for the first two types of networks, the entropy rate shows a nonmonotonic dependence on γ. There exists an optimal value of γ at which the entropy rate reaches a maximum. Such a maximum is larger than that of maximal-entropy random walks (MREWs) and standard random walks (SRWs) on the same topology, while for the BA network the entropy rate of RRWs either shows a unique maximum or decreases monotonically with γ, depending upon the choice of the resetting node. When the maximum entropy rate of RRWs exists, it can be higher or lower than that of MREWs or SRWs. Our study reveals a nontrivial effect of stochastic resetting on nonequilibrium statistical physics.

Diffusion with partial resetting

Inspired by many examples in nature, stochastic resetting of random processes has been studied extensively in the past decade. In particular, various models of stochastic particle motion were considered where, upon resetting, the particle is returned to its initial position. Here we generalize the model of diffusion with resetting to account for situations where a particle is returned only a fraction of its distance to the origin, e.g., half way. We show that this model always attains a steady-state distribution which can be written as an infinite sum of independent, but not identical, Laplace random variables. As a result, we find that the steady-state transitions from the known Laplace form which is obtained in the limit of full resetting to a Gaussian form, which is obtained close to the limit of no resetting. A similar transition is shown to be displayed by drift diffusion whose steady state can also be expressed as an infinite sum of independent random variables. Finally, we extend our analysis to capture the temporal evolution of drift diffusion with partial resetting, providing a bottom-up probabilistic construction that yields a closed-form solution for the time-dependent distribution of this process in Fourier-Laplace space. Possible extensions and applications of diffusion with partial resetting are discussed.

Encounter-based approach to diffusion with resetting

An encounter-based approach consists in using the boundary local time as a proxy for the number of encounters between a diffusing particle and a target to implement various surface reaction mechanisms on that target. In this paper, we investigate the effects of stochastic resetting onto diffusion-controlled reactions in bounded confining domains. We first discuss the effect of position resetting onto the propagator and related quantities; in this way, we retrieve a number of earlier results but also provide complementary insights into them. Second, we introduce boundary local time resetting and investigate its impact. Curiously, we find that this type of resetting does not alter the conventional propagator governing the diffusive dynamics in the presence of a partially reactive target with a constant reactivity. In turn, the generalized propagator for other surface reaction mechanisms can be significantly affected. Our general results are illustrated for diffusion on an interval with reactive end points. Further perspectives and some open problems are discussed.

First-passage time of run-and-tumble particles with noninstantaneous resetting

We study the statistics of the first-passage time of a single run-and-tumble particle (RTP) in one spatial dimension, with or without resetting, to a fixed target located at L>0. First, we compute the first-passage time distribution of a free RTP, without resetting or in a confining potential, but averaged over the initial position drawn from an arbitrary distribution p(x). Recent experiments used a noninstantaneous resetting protocol that motivated us to study in particular the case where p(x) corresponds to the stationary non-Boltzmann distribution of an RTP in the presence of a harmonic trap. This distribution p(x) is characterized by a parameter ν>0, which depends on the microscopic parameters of the RTP dynamics. We show that the first-passage time distribution of the free RTP, drawn from this initial distribution, develops interesting singular behaviors, depending on the value of ν. We then switch on resetting, mimicked by relaxation of the RTP in the presence of a harmonic trap. Resetting leads to a finite mean first-passage time and we study this as a function of the resetting rate for different values of the parameters ν and b=L/c, where c is the position of the right edge of the initial distribution p(x). In the diffusive limit of the RTP dynamics, we find a rich phase diagram in the (b,ν) plane, with an interesting reentrance phase transition. Away from the diffusive limit, qualitatively similar rich behaviors emerge for the full RTP dynamics.

Random walks on complex networks under time-dependent stochastic resetting

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-ϕ(a) or is reset to a given node with a complementary probability ϕ(a). The resetting probability ϕ(a) depends on the time a since the last reset event (also called a, the age of the walker). Using the renewal approach and spectral decomposition of the transition matrix, we formulate the stationary occupation probability of the walker at each node and the mean first passage time between two arbitrary nodes. Concretely, we consider two different time-dependent resetting protocols that are both exactly solvable. One is that ϕ(a) is a step-shaped function of a and the other one is that ϕ(a) is a rational function of a. We demonstrate the theoretical results on several different networks, also validated by numerical simulations, and find that the time-modulated resetting protocols can be more advantageous than the constant-probability resetting in accelerating the completion of a target search process.

Expediting Feller process with stochastic resetting

We explore the effect of stochastic resetting on the first-passage properties of the Feller process. The Feller process can be envisioned as space-dependent diffusion, with diffusion coefficient D(x)=x, in a potential U(x)=x(x/2-θ) that owns a minimum at θ. This restricts the process to the positive side of the origin and therefore, Feller diffusion can successfully model a vast array of phenomena in biological and social sciences, where realization of negative values is forbidden. In our analytically tractable model system, a particle that undergoes Feller diffusion is subject to Poissonian resetting, i.e., taken back to its initial position at a constant rate r, after random time epochs. We addressed the two distinct cases that arise when the relative position of the absorbing boundary (x_{a}) with respect to the initial position of the particle (x_{0}) differ, i.e., for (a) x_{0}<x_{a} and (b) x_{a}<x_{0}. Utilizing the Fokker-Planck description of the system, we obtained closed-form expressions for the Laplace transform of the survival probability and hence derived the exact expressions of the mean first-passage time 〈T_{r}〉. Performing a comprehensive analysis on the optimal resetting rate (r^{★}) that minimize 〈T_{r}〉 and the maximal speedup that r^{★} renders, we identify the phase space where Poissonian resetting facilitates first-passage for Feller diffusion. We observe that for x_{0}<x_{a}, resetting accelerates first-passage when θ<θ_{c}, where θ_{c} is a critical value of θ that decreases when x_{a} is moved away from the origin. In stark contrast, for x_{a}<x_{0}, resetting accelerates first-passage when θ>θ_{c}, where θ_{c} is a critical value of θ that increases when x_{0} is moved away from the origin. Our study opens up the possibility of a series of subsequent works with more case-specific models of Feller diffusion with resetting.

Conditioned backward and forward times of diffusion with stochastic resetting: A renewal theory approach

Stochastic resetting can be naturally understood as a renewal process governing the evolution of an underlying stochastic process. In this work, we formally derive well-known results of diffusion with resets from a renewal theory perspective. Parallel to the concepts from renewal theory, we introduce the conditioned backward B and forward F times being the times since the last and until the next reset, respectively, given that the current state of the system X(t) is known. These magnitudes are introduced with the paradigmatic case of diffusion under resetting, for which the backward and forward times are conditioned to the position of the walker. We find analytical expressions for the conditioned backward and forward time probability density functions (PDFs), and we compare them with numerical simulations. The general expressions allow us to study particular scenarios. For instance, for power-law reset time PDFs such that φ(t)∼t^{-1-α}, significant changes in the properties of the conditioned backward and forward times happen at half-integer values of α due to the composition between the long-time scaling of diffusion P(x,t)∼1/sqrt[t] and the reset time PDF.

Synchronization in the Kuramoto model in presence of stochastic resetting

What happens when the paradigmatic Kuramoto model involving interacting oscillators of distributed natural frequencies and showing spontaneous collective synchronization in the stationary state is subject to random and repeated interruptions of its dynamics with a reset to the initial condition? While resetting to a synchronized state, it may happen between two successive resets that the system desynchronizes, which depends on the duration of the random time interval between the two resets. Here, we unveil how such a protocol of stochastic resetting dramatically modifies the phase diagram of the bare model, allowing, in particular, for the emergence of a synchronized phase even in parameter regimes for which the bare model does not support such a phase. Our results are based on an exact analysis invoking the celebrated Ott-Antonsen ansatz for the case of the Lorentzian distribution of natural frequencies and numerical results for Gaussian frequency distribution. Our work provides a simple protocol to induce global synchrony in the system through stochastic resetting.

Mitigating long queues and waiting times with service resetting

What determines the average length of a queue, which stretches in front of a service station? The answer to this question clearly depends on the average rate at which jobs arrive at the queue and on the average rate of service. Somewhat less obvious is the fact that stochastic fluctuations in service and arrival times are also important, and that these are a major source of backlogs and delays. Strategies that could mitigate fluctuations-induced delays are, thus in high demand as queue structures appear in various natural and man-made systems. Here, we demonstrate that a simple service resetting mechanism can reverse the deleterious effects of large fluctuations in service times, thus turning a marked drawback into a favorable advantage. This happens when stochastic fluctuations are intrinsic to the server, and we show that service resetting can then dramatically cut down average queue lengths and waiting times. Remarkably, this strategy is also useful in extreme situations where the variance, and possibly even mean, of the service time diverge-as resetting can then prevent queues from "blowing up." We illustrate these results on the M/G/1 queue in which service times are general and arrivals are assumed to be Markovian. However, the main results and conclusions coming from our analysis are not specific to this particular model system. Thus, the results presented herein can be carried over to other queueing systems: in telecommunications, via computing, and all the way to molecular queues that emerge in enzymatic and metabolic cycles of living organisms.

General approach to stochastic resetting

We address the effect of stochastic resetting on diffusion and subdiffusion process. For diffusion we find that mean square displacement relaxes to a constant only when the distribution of reset times possess finite mean and variance. In this case, the leading order contribution to the probability density function (PDF) of a Gaussian propagator under resetting exhibits a cusp independent of the specific details of the reset time distribution. For subdiffusion we derive the PDF in Laplace space for arbitrary resetting protocol. Resetting at constant rate allows evaluation of the PDF in terms of H function. We analyze the steady state and derive the rate function governing the relaxation behavior. For a subdiffusive process the steady state could exist even if the distribution of reset times possesses only finite mean.

Interplay of noise induced stability and stochastic resetting

Stochastic resetting and noise-enhanced stability are two phenomena that can affect the lifetime and relaxation of nonequilibrium states. They can be considered measures of controlling the efficiency of the completion process when a stochastic system has to reach the desired state. Here, we study the interaction of random (Poissonian) resetting and stochastic dynamics in unstable potentials. Unlike noise-induced stability that increases the relaxation time, the stochastic resetting may eliminate winding trajectories contributing to the lifetime and accelerate the escape kinetics from unstable states. In this paper, we present a framework to analyze compromises between the two contrasting phenomena in noise-driven kinetics subject to random restarts.

Optimal Resetting Brownian Bridges via Enhanced Fluctuations

We introduce a resetting Brownian bridge as a simple model to study search processes where the total search time t_{f} is finite and the searcher returns to its starting point at t_{f}. This is simply a Brownian motion with a Poissonian resetting rate r to the origin which is constrained to start and end at the origin at time t_{f}. We unveil a surprising general mechanism that enhances fluctuations of a Brownian bridge, by introducing a small amount of resetting. This is verified for different observables, such as the mean-square displacement, the hitting probability of a fixed target and the expected maximum. This mechanism, valid for a Brownian bridge in arbitrary dimensions, leads to a finite optimal resetting rate that minimizes the time to search a fixed target. The physical reason behind an optimal resetting rate in this case is entirely different from that of resetting Brownian motions without the bridge constraint. We also derive an exact effective Langevin equation that generates numerically the trajectories of a resetting Brownian bridge in all dimensions via a completely rejection-free algorithm.

Nonstandard diffusion under Markovian resetting in bounded domains

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 distribution between consecutive short jumps. We investigate the existence of an optimal reset rate, which minimizes the mean exit passage time, in terms of the statistical properties of the waiting time probability. Generalizing previous results, we find that when the waiting time probability has first and second finite moments, resetting can be either (i) never beneficial, (ii) beneficial depending on the distance of the reset point to the boundary, or (iii) always beneficial. Instead, when the waiting time probability has the first or the two first moments diverging we find that resetting is always beneficial. Finally, we have also found that the optimal strategy to exit the domain depends on the reset rate. For low reset rates, walkers with exponential waiting times are found to be optimal, while for high reset rate, anomalous waiting times optimize the search process.

First passage in the presence of stochastic resetting and a potential barrier

Diffusion and first passage in the presence of stochastic resetting and potential bias have been of recent interest. We study a few models, systematically progressing in their complexity, to understand the usefulness of resetting. In the parameter space of the models, there are multiple continuous and discontinuous transitions where the advantage of resetting vanishes. We show these results analytically exactly for a tent potential, and numerically accurately for a quartic potential relevant to a magnetic system at low temperatures. We find that the spatial asymmetry of the potential across the barrier, and the number of absorbing boundaries, play a crucial role in determining the type of transition.

First passage of a diffusing particle under stochastic resetting in bounded domains with spherical symmetry

We investigate the first passage properties of a Brownian particle diffusing freely inside a d-dimensional sphere with absorbing spherical surface subject to stochastic resetting. We derive the mean time to absorption (MTA) as functions of resetting rate γ and initial distance r of the particle to the center of the sphere. We find that when r>r_{c} there exists a nonzero optimal resetting rate γ_{opt} at which the MTA is a minimum, where r_{c}=sqrt[d/(d+4)]R and R is the radius of the sphere. As r increases, γ_{opt} exhibits a continuous transition from zero to nonzero at r=r_{c}. Furthermore, we consider that the particle lies between two two-dimensional or three-dimensional concentric spheres with absorbing boundaries, and obtain the domain in which resetting expedites the MTA, which is (R_{1},r_{c_{1}})∪(r_{c_{2}},R_{2}), with R_{1} and R_{2} being the radii of inner and outer spheres, respectively. Interestingly, when R_{1}/R_{2} is less than a critical value, γ_{opt} exhibits a discontinuous transition at r=r_{c_{1}}; otherwise, such a transition is continuous. However, at r=r_{c_{2}} the transition is always continuous.

Tuning of the Dielectric Relaxation and Complex Susceptibility in a System of Polar Molecules: A Generalised Model Based on Rotational Diffusion with Resetting

The application of the fractional calculus in the mathematical modelling of relaxation processes in complex heterogeneous media has attracted a considerable amount of interest lately. The reason for this is the successful implementation of fractional stochastic and kinetic equations in the studies of non-Debye relaxation. In this work, we consider the rotational diffusion equation with a generalised memory kernel in the context of dielectric relaxation processes in a medium composed of polar molecules. We give an overview of existing models on non-exponential relaxation and introduce an exponential resetting dynamic in the corresponding process. The autocorrelation function and complex susceptibility are analysed in detail. We show that stochastic resetting leads to a saturation of the autocorrelation function to a constant value, in contrast to the case without resetting, for which it decays to zero. The behaviour of the autocorrelation function, as well as the complex susceptibility in the presence of resetting, confirms that the dielectric relaxation dynamics can be tuned by an appropriate choice of the resetting rate. The presented results are general and flexible, and they will be of interest for the theoretical description of non-trivial relaxation dynamics in heterogeneous systems composed of polar molecules.

Run with the Brownian Hare, Hunt with the Deterministic Hounds

We present analytic results for mean capture time and energy expended by a pack of deterministic hounds actively chasing a randomly diffusing prey. Depending on the number of chasers, the mean capture time as a function of the prey's diffusion coefficient can be monotonically increasing, decreasing, or attain a minimum at a finite value. Optimal speed and number of chasing hounds exist and depend on each chaser's baseline power consumption. The model can serve as an analytically tractable basis for further studies with bearing on the growing field of smart microswimmers and autonomous robots.

First detection of threshold crossing events under intermittent sensing

The time taken by a random variable to cross a threshold for the first time, known as the first passage time, is of interest in many areas of sciences and engineering. Conventionally, there is an implicit assumption that the notional "sensor" monitoring the threshold crossing event is always active. In many realistic scenarios, the sensor monitoring the stochastic process works intermittently. Then, the relevant quantity of interest is the first detection time, which denotes the time when the sensor detects the random variable to be above the threshold for the first time. In this Letter, a birth-death process monitored by a random intermittent sensor is studied for which the first detection time distribution is obtained. In general, it is shown that the first detection time is related to and is obtainable from the first passage time distribution. Our analytical results display an excellent agreement with simulations. Furthermore, this framework is demonstrated in several applications-the susceptible infected susceptible compartmental and logistic models and birth-death processes with resetting. Finally, we solve the practically relevant problem of inferring the first passage time distribution from the first detection time.

Gaussian process and Lévy walk under stochastic noninstantaneous resetting and stochastic rest

A stochastic process with movement, return, and rest phases is considered in this paper. For the movement phase, the particles move following the dynamics of the Gaussian process or the ballistic type of Lévy walk, and the time of each movement is random. For the return phase, the particles will move back to the origin with a constant velocity or acceleration or under the action of a harmonic force after each movement, so that this phase can also be treated as a noninstantaneous resetting. After each return, a rest with a random time at the origin follows. The asymptotic behaviors of the mean-squared displacements with different kinds of movement dynamics, returning, and random resting time are discussed. The stationary distributions are also considered when the process is localized. In addition, the mean first passage time is considered when the dynamic of the movement phase is Brownian motion.

Universal kinetics of imperfect reactions in confinement

Chemical reactions generically require that particles come into contact. In practice, reaction is often imperfect and can necessitate multiple random encounters between reactants. In confined geometries, despite notable recent advances, there is to date no general analytical treatment of such imperfect transport-limited reaction kinetics. Here, we determine the kinetics of imperfect reactions in confining domains for any diffusive or anomalously diffusive Markovian transport process, and for different models of imperfect reactivity. We show that the full distribution of reaction times is obtained in the large confining volume limit from the knowledge of the mean reaction time only, which we determine explicitly. This distribution for imperfect reactions is found to be identical to that of perfect reactions upon an appropriate rescaling of parameters, which highlights the robustness of our results. Strikingly, this holds true even in the regime of low reactivity where the mean reaction time is independent of the transport process, and can lead to large fluctuations of the reaction time - even in simple reaction schemes. We illustrate our results for normal diffusion in domains of generic shape, and for anomalous diffusion in complex environments, where our predictions are confirmed by numerical simulations.

One-dimensional telegraphic process with noninstantaneous stochastic resetting

In this paper, we consider the one-dimensional dynamical evolution of a particle traveling at constant speed and performing, at a given rate, random reversals of the velocity direction. The particle is subject to stochastic resetting, meaning that at random times it is forced to return to the starting point. Here we consider a return mechanism governed by a deterministic law of motion, so that the time cost required to return is correlated to the position occupied at the time of the reset. We show that in such conditions the process reaches a stationary state which, for some kinds of deterministic return dynamics, is independent of the return phase. Furthermore, we investigate the first-passage properties of the system and provide explicit formulas for the mean first-hitting time. Our findings are supported by numerical simulations.

Time averaging and emerging nonergodicity upon resetting of fractional Brownian motion and heterogeneous diffusion processes

How different are the results of constant-rate resetting of anomalous-diffusion processes in terms of their ensemble-averaged versus time-averaged mean-squared displacements (MSDs versus TAMSDs) and how does stochastic resetting impact nonergodicity? We examine, both analytically and by simulations, the implications of resetting on the MSD- and TAMSD-based spreading dynamics of particles executing fractional Brownian motion (FBM) with a long-time memory, heterogeneous diffusion processes (HDPs) with a power-law space-dependent diffusivity D(x)=D_{0}|x|^{γ} and their "combined" process of HDP-FBM. We find, inter alia, that the resetting dynamics of originally ergodic FBM for superdiffusive Hurst exponents develops disparities in scaling and magnitudes of the MSDs and mean TAMSDs indicating weak ergodicity breaking. For subdiffusive HDPs we also quantify the nonequivalence of the MSD and TAMSD and observe a new trimodal form of the probability density function. For reset FBM, HDPs and HDP-FBM we compute analytically and verify by simulations the short-time MSD and TAMSD asymptotes and long-time plateaus reminiscent of those for processes under confinement. We show that certain characteristics of these reset processes are functionally similar despite a different stochastic nature of their nonreset variants. Importantly, we discover nonmonotonicity of the ergodicity-breaking parameter EB as a function of the resetting rate r. For all reset processes studied we unveil a pronounced resetting-induced nonergodicity with a maximum of EB at intermediate r and EB∼(1/r)-decay at large r. Alongside the emerging MSD-versus-TAMSD disparity, this r-dependence of EB can be an experimentally testable prediction. We conclude by discussing some implications to experimental systems featuring resetting dynamics.

Random walks on complex networks with multiple resetting nodes: A renewal approach

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 networks with multiple resetting nodes. Using a renewal approach, we derive exact expressions of the occupation probability of the walker in each node and mean first-passage time between arbitrary two nodes. All the results can be expressed in terms of the spectral properties of the transition matrix in the absence of resetting. We demonstrate our results on circular networks, stochastic block models, and Barabási-Albert scale-free networks and find the advantage of the resetting processes to multiple resetting nodes in a global search on such networks. Finally, the distribution of resetting probabilities is optimized via a simulated annealing algorithm, so as to minimize the mean first-passage time averaged over arbitrary two distinct nodes.

Geometric Brownian motion under stochastic resetting: A stationary yet nonergodic process

We study the effects of stochastic resetting on geometric Brownian motion with drift (GBM), a canonical stochastic multiplicative process for nonstationary and nonergodic dynamics. Resetting is a sudden interruption of a process, which consecutively renews its dynamics. We show that, although resetting renders GBM stationary, the resulting process remains nonergodic. Quite surprisingly, the effect of resetting is pivotal in manifesting the nonergodic behavior. In particular, we observe three different long-time regimes: a quenched state, an unstable state, and a stable annealed state depending on the resetting strength. Notably, in the last regime, the system is self-averaging and thus the sample average will always mimic ergodic behavior establishing a stand-alone feature for GBM under resetting. Crucially, the above-mentioned regimes are well separated by a self-averaging time period which can be minimized by an optimal resetting rate. Our results can be useful to interpret data emanating from stock market collapse or reconstitution of investment portfolios.

Optimal Non-Markovian Search Strategies with n-Step Memory

Stochastic search processes are ubiquitous in nature and are expected to become more efficient when equipped with a memory, where the searcher has been before. A natural realization of a search process with long-lasting memory is a migrating cell that is repelled from the diffusive chemotactic signal that it secretes on its way, denoted as an autochemotactic searcher. To analyze the efficiency of this class of non-Markovian search processes, we present a general formalism that allows one to compute the mean first-passage time (MFPT) for a given set of conditional transition probabilities for non-Markovian random walks on a lattice. We show that the optimal choice of the n-step transition probabilities decreases the MFPT systematically and substantially with an increasing number of steps. It turns out that the optimal search strategies can be reduced to simple cycles defined by a small parameter set and that mirror-asymmetric walks are more efficient. For the autochemotactic searcher, we show that an optimal coupling between the searcher and the chemical reduces the MFPT to 1/3 of the one for a Markovian random walk.

Random walks on complex networks with first-passage resetting

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 either of observable nodes. We derive exact expressions of the stationary occupation probability, the average number of resets in the long time, and the mean first-passage time between arbitrary two nonobservable nodes. We show that all the quantities can be expressed in terms of the fundamental matrix Z=(I-Q)^{-1}, where I is the identity matrix and Q is the transition matrix between nonobservable nodes. Finally, we use ring networks, two-dimensional square lattices, barbell networks, and Cayley trees to demonstrate the advantage of first-passage resetting in global search on such networks.

Diffusive transport on networks with stochastic resetting to multiple nodes

We study the diffusive transport of Markovian random walks on arbitrary networks with stochastic resetting to multiple nodes. We deduce analytical expressions for the stationary occupation probability and for the mean and global first passage times. This general approach allows us to characterize the effect of resetting on the capacity of random walk strategies to reach a particular target or to explore the network. Our formalism holds for ergodic random walks and can be implemented from the spectral properties of the random walk without resetting, providing a tool to analyze the efficiency of search strategies with resetting to multiple nodes. We apply the methods developed here to the dynamics with two reset nodes and derive analytical results for normal random walks and Lévy flights on rings. We also explore the effect of resetting to multiple nodes on a comb graph, Lévy flights that visit specific locations in a continuous space, and the Google random walk strategy on regular networks.

Unified Approach to Gated Reactions on Networks

For two molecules to react they first have to meet. Yet, reaction times are rarely on par with the first-passage times that govern such molecular encounters. A prime reason for this discrepancy is stochastic transitions between reactive and nonreactive molecular states, which results in effective gating of product formation and altered reaction kinetics. To better understand this phenomenon we develop a unifying approach to gated reactions on networks. We first show that the mean and distribution of the gated reaction time can always be expressed in terms of ungated first-passage and return times. This relation between gated and ungated kinetics is then explored to reveal universal features of gated reactions. The latter are exemplified using a diverse set of case studies which are also used to expose the exotic kinetics that arises due to molecular gating.

Stochastic resetting by a random amplitude

Stochastic resetting, a diffusive process whose amplitude is reset to the origin at random times, is a vividly studied strategy to optimize encounter dynamics, e.g., in chemical reactions. Here we generalize the resetting step by introducing a random resetting amplitude such that the diffusing particle may be only partially reset towards the trajectory origin or even overshoot the origin in a resetting step. We introduce different scenarios for the random-amplitude stochastic resetting process and discuss the resulting dynamics. Direct applications are geophysical layering (stratigraphy) and population dynamics or financial markets, as well as generic search processes.

Dichotomous flow with thermal diffusion and stochastic resetting

We consider properties of one-dimensional diffusive dichotomous flow and discuss effects of stochastic resonant activation (SRA) in the presence of a statistically independent random resetting mechanism. Resonant activation and stochastic resetting are two similar effects, as both of them can optimize the noise-induced escape. Our studies show completely different origins of optimization in adapted setups. Efficiency of stochastic resetting relies on elimination of suboptimal trajectories, while SRA is associated with matching of time scales in the dynamic environment. Consequently, both effects can be easily tracked by studying their asymptotic properties. Finally, we show that stochastic resetting cannot be easily used to further optimize the SRA in symmetric setups.

First passage under restart for discrete space and time: Application to one-dimensional confined lattice random walks

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 outperform the completion of many first-passage processes which otherwise would take longer time to finish. However, most of the studies so far assumed continuous time underlying first-passage time processes and moreover considered continuous time resetting restricting out restart processes broken up into synchronized time steps. To bridge this gap, in this paper, we study discrete space and time first-passage processes under discrete time resetting in a general setup without specifying their forms. We sketch out the steps to compute the moments and the probability density function which is often intractable in the continuous time restarted process. A criterion that dictates when restart remains beneficial is then derived. We apply our results to a symmetric and a biased random walker in one-dimensional lattice confined within two absorbing boundaries. Numerical simulations are found to be in excellent agreement with the theoretical results. Our method can be useful to understand the effect of restart on the spatiotemporal dynamics of confined lattice random walks in arbitrary dimensions.

Extremal statistics for stochastic resetting systems

While averages and typical fluctuations often play a major role in understanding the behavior of a nonequilibrium system, this nonetheless is not always true. Rare events and large fluctuations are also pivotal when a thorough analysis of the system is being done. In this context, the statistics of extreme fluctuations in contrast to the average plays an important role, as has been discussed in fields ranging from statistical and mathematical physics to climate, finance, and ecology. Herein, we study extreme value statistics (EVS) of stochastic resetting systems, which have recently gained significant interest due to its ubiquitous and enriching applications in physics, chemistry, queuing theory, search processes, and computer science. We present a detailed analysis for the finite and large time statistics of extremals (maximum and arg-maximum, i.e., the time when the maximum is reached) of the spatial displacement in such system. In particular, we derive an exact renewal formula that relates the joint distribution of maximum and arg-maximum of the reset process to the statistical measures of the underlying process. Benchmarking our results for the maximum of a reset trajectory that pertain to the Gumbel class for large sample size, we show that the arg-maximum density attains a uniform distribution independent of the underlying process at a large observation time. This emerges as a manifestation of the renewal property of the resetting mechanism. The results are augmented with a wide spectrum of Markov and non-Markov stochastic processes under resetting, namely, simple diffusion, diffusion with drift, Ornstein-Uhlenbeck process, and random acceleration process in one dimension. Rigorous results are presented for the first two setups, while the latter two are supported with heuristic and numerical analysis.

Resetting transition is governed by an interplay between thermal and potential energy

A dynamical process that takes a random time to complete, e.g., a chemical reaction, may either be accelerated or hindered due to resetting. Tuning system parameters, such as temperature, viscosity, or concentration, can invert the effect of resetting on the mean completion time of the process, which leads to a resetting transition. Although the resetting transition has been recently studied for diffusion in a handful of model potentials, it is yet unknown whether the results follow any universality in terms of well-defined physical parameters. To bridge this gap, we propose a general framework that reveals that the resetting transition is governed by an interplay between the thermal and potential energy. This result is illustrated for different classes of potentials that are used to model a wide variety of stochastic processes with numerous applications.