“Gating” is a widely observed phenomenon in biochemistry that describes the transition between the activated (or open) and deactivated (or closed) states of an ion-channel, which makes transport through that channel highly selective. In general, gating is a mechanism that imposes an additional restriction on a transport, as the process ends only when the “gate” is open and continues otherwise. When diffusion occurs in the presence of a constant bias to a gated target, i.e., to a target that switches between an open and a closed state, the dynamics essentially slow down compared to ungated drift-diffusion, resulting in an increase in the mean completion time, ⟨TG⟩ > ⟨T⟩, where T denotes the random time of transport and G indicates gating. In this work, we utilize stochastic resetting as an external protocol to counterbalance the delay due to gating. We consider a particle in the positive semi-infinite space that undergoes drift-diffusion in the presence of a stochastically gated target at the origin and is moreover subjected to rate-limiting resetting dynamics. Calculating the minimal mean completion time TrG rendered by an optimal resetting rate r for this exactly solvable system, we construct a phase diagram that owns three distinct phases: (i) where resetting can make gated drift-diffusion faster even compared to the original ungated process, TrG<T<TG, (ii) where resetting still expedites gated drift-diffusion but not beyond the original ungated process, TTrG<TG, and (iii) where resetting fails to expedite gated drift-diffusion, T<TGTrG. We also highlight various non-trivial behaviors of the completion time as the resetting rate, gating parameters, and geometry of the set-up are carefully ramified. Gated drift-diffusion aptly models various stochastic processes such as chemical reactions that exclusively take place in certain activated states of the reactants. Our work predicts the conditions under which stochastic resetting can act as a useful strategy to enhance the rate of such processes without compromising their selectivity.

“Gating” in biochemistry typically refers to the transition between the open and closed states of an ion channel; the ions are allowed to flow through the channel only when it is open.1 In a gated chemical reaction, the reactant molecules switch between a reactive and a non-reactive state; the collisions between the reactants must happen in their reactive states for a successful reaction. Therefore, gating is a signature of a constrained reaction/transport, be it an enzyme finding the correct substrate, a protein finding the target site along a DNA strand, or associating with a cleavage site on a peptide. Given their very generic nature, it is no wonder why gated processes showcase a myriad of applications spanning across fields from chemistry2–5 and physics6–12 to biology.13–15 

Since the seminal works of Szabo et al.,4,6,16 gated processes have gained considerable attention across a wide panorama of applications such as 1D gated continuous-time and discrete-space random search processes in confinement,8 intermittent switching dynamics of a protein undertaking facilitated diffusion on a DNA strand,17 3D gated diffusive search processes with different diffusivities,9 and gated active particles,18 to name a few. Gopich and Szabo explored the possibility of multiple gated particles/targets in a model with intrinsic reversible binding.11 On the mathematical side, Lawley and Keener established a connection between a radiative/reactive boundary and a gated boundary in diffusion controlled reactions.19 There has been a renewed interest in the field emanating from the works by Mercado-Vásquez and Boyer on a 1D gated diffusive process on the infinite line,20 Scher and Reuveni on gated reactions on arbitrary networks including random walk models both in continuous21 and discrete time,22 and Kumar et al. on threshold crossing events of a gated process23 and inference of first-passage times from the detection times of gated diffusive first-passage processes.24 In a similar vein, in this work, we delve deeper into a gated diffusive process and, in particular, focus on design principles to improve the efficiency of a gated reaction [see Fig. 1].

FIG. 1.

Scheme for a gated chemical reaction between two reactants R1 and R2, catalyzed by C. In the first step, the catalyst initiates the reaction by binding reversibly with R1 to generate CR1, a metastable intermediate: C + R1CR1. In the second step, CR1 reacts selectively with R2 (the reactive or open-gate state of R2) to generate the product P and liberate the catalyst: CR1+R2C+P. This step can be modeled by gated drift-diffusion, while the unbinding of C from R1 is essentially resetting.

FIG. 1.

Scheme for a gated chemical reaction between two reactants R1 and R2, catalyzed by C. In the first step, the catalyst initiates the reaction by binding reversibly with R1 to generate CR1, a metastable intermediate: C + R1CR1. In the second step, CR1 reacts selectively with R2 (the reactive or open-gate state of R2) to generate the product P and liberate the catalyst: CR1+R2C+P. This step can be modeled by gated drift-diffusion, while the unbinding of C from R1 is essentially resetting.

Close modal

For a gated diffusive process to be complete, a certain condition that mimics the open-gate-scenario, imposed either on the diffusing entity or on the target that it diffuses to, needs to be fulfilled. This additional restriction imposed due to gating certainly makes the process more selective, which is essential for the associated biochemical system to function properly. The cost of this selectivity, however, reflects on the completion time, which makes a gated diffusive process essentially slower than the corresponding ungated one. However, nature has its own way of curtailing such situations to allow effective reactions. For example, consider a chemical reaction such as in Fig. 1, where an unbinding or a resetting from a metastable state can lead to a facilitated reaction. The effects of such resetting events are proven to be crucial not only in such chemical reactions25,26 but also in the backtracking of RNA polymerase27 and the disassociation kinetics of RhoA in the membrane.28 The motion of the reactants or the morphogens, which get produced constantly from a certain place inside the cell before degrading in time (due to their finite lifetime), can also be interpreted as stochastically restarted processes.29 On the physics side, it has been established in the pioneering work of Evans and Majumdar30 that stochastic resetting can be utilized as a powerful strategy to expedite the completion time of a 1D diffusive search process. This remarkable result led to many fascinating works where it was shown that indeed this intermittent resetting strategy can benefit the search processes conducted by diffusion controlled31–40 and non-diffusive stochastic processes41–44 (see here, Ref. 45, for an extensive review of the subject). Single particle experiments using optical traps have also paved the way for our understanding of resetting modulated search processes.46,47 Despite these advances, there has been a persistent void in the understanding of resetting induced gated processes until recently, when resetting mechanisms have been used to reduce the average completion time of a gated diffusive process in 1D.48,49

While resetting is a useful strategy to benefit the diffusive transport of ions/molecules in unbounded phase space, the same cannot be said for a drift-diffusive search process. There, resetting can be useful only if the rate of diffusive transport is higher compared to the rate of driven transport.50,51,54,55 However, if the drift supersedes the transport of molecules across the channel, resetting can only hinder its completion, resulting in a longer transit time. This crucial interplay can then be understood in terms of the so-called Péclet number, which is a ratio between the diffusion- and drift-dominated microscopic timescales.50,51 In fact, the role of resetting can be quantified within a universal set-up of first-passage under restart, which essentially teaches us that resetting will always be beneficial if the underlying process without resetting has a coefficient of variation (often known as the signal-to-noise ratio)—a statistical measure of dispersion in the random completion time, defined as the ratio of its standard deviation to its mean—greater than unity.42,56,57 These observations naturally set the stage for understanding the role of resetting in a gated drift-diffusive search process which, to the best of our knowledge, has not been studied so far. In particular, the central objective of this work is to understand whether resetting can enhance the completion rate of a gated drift-diffusive search process and, if so, under what conditions. Unraveling the intricate roles of drift, diffusion, and gating, along with that of resetting, will be at the heart of this study.

To illustrate the set-up of the present work, let us consider a diffusive transport process confined to the positive semi-infinite space in the presence of a constant drift that is directed toward a target that randomly switches between an open and a closed state with constant rates. This is a general scenario mimicked by, e.g., a chemical reaction (see Fig. 1), where the collisions between reactants (CR1 and R2) lead to the formation of product only when at least one of the reactants is in an activated state (when R2 exists as R2) and not otherwise. Since resetting is an integral part of any consecutive chemical reaction that has a reversible first-step (when C binds to, or unbinds from, R1), the reaction scheme shown in Fig. 1 can be modeled as gated drift-diffusion with resetting. In this paper, we study the completion time statistics for this general setup. In particular, we perform a comprehensive analysis to understand the role of optimal resetting in enhancing the rate of such transport and construct a complete phase diagram that distinguishes between the phases where (i) resetting accelerates gated drift-diffusion beyond the original (without resetting) ungated process, (ii) resetting still proves itself to be beneficial by improving the rate of gated drift-diffusion but not beyond the original ungated process, and (iii) resetting cannot expedite gated drift-diffusion.

The rest of the paper is organized as follows. In Sec. II, we describe the model and follow a Fokker–Planck approach to write down the governing equations for a gated drift-diffusion process that is subject to resetting. In the same Section, we solve those equations to calculate the mean completion time, denoted TrG. We calculate the optimal resetting rate r that minimizes TrG and thereby investigate the conditions for resetting to expedite the process completion in Sec. III. There, various limits of the system parameters are also examined in detail. We calculate the maximal speedup that can be achieved, within our set-up, by the optimal resetting rate in Sec. IV. In Sec. V, we construct a full phase diagram that characterizes all the possible regimes underpinning the role of resetting in the process’s completion. We conclude with a brief summary and outlook of our work in Sec. VI. Some of the detailed derivations have been moved to  Appendixes A–D for brevity.

We start by casting the problem of gated chemical reactions (CR1+R2C+P, introduced in Fig. 1) as gated drift-diffusion. A convenient way to do so is to map the reaction coordinate associated with the reactant CR1+R2 onto the starting position (x0 > 0; see Fig. 2) of a particle that undergoes Brownian motion. Similarly, the reaction coordinates for the products C + P can be mapped onto the position of a target (placed at the origin, see Fig. 2). The chemical potential drive, which governs the reaction to its completion, can then be translated to a constant bias λ that the particle experiences while it diffuses to the target with a diffusion coefficient D. Note that λ is considered to be positive when it acts toward the target and negative when it acts away from the target. Such an effective one-dimensional projection of the energy landscape of an enzyme or protein conformation is a well-adapted approach in the literature (see Refs. 58–60 for more details). Nonetheless, there are a few key assumptions that we make during the mapping. First, we take into account the well-established fact that the chemical master equations for the discrete states can be coarse-grained into the Fokker–Planck equations for the reaction coordinates in the continuous space using a system size expansion.61,62 However, this conversion generically renders the drift and diffusion terms to be spatially dependent. In other words, the reaction coordinate associated with the catalysis process CR1+R2C+P is expected to diffuse in an arbitrary energy landscape, where the product state C + P is usually denoted by the global minimum. However, to simplify the problem, we replace the general potential with a linear one, which leads to a constant drift velocity λ toward (or away from) the gated target. This is the second assumption that lies behind our analysis. Albeit these simplified approximations, the major advantage here is the elegant analytical tractability of the model, from which one can also unveil the crucial interplay between the gated boundary and the resetting/unbinding mechanism.

FIG. 2.

Schematic diagram of a gated drift-diffusion process in semi-infinite space with resetting, where the target (placed at the origin) switches stochastically between a reactive state (σ = 1) and a non-reactive state (σ = 0). The transition from the non-reactive to the reactive state takes place with a constant rate α > 0, and the opposite transition takes place with a constant rate β > 0. When the particle, starting at x0, hits the target in its reactive state (dashed line), the process ends. TrG marks the random completion time of the gated drift-diffusion process after resetting.

FIG. 2.

Schematic diagram of a gated drift-diffusion process in semi-infinite space with resetting, where the target (placed at the origin) switches stochastically between a reactive state (σ = 1) and a non-reactive state (σ = 0). The transition from the non-reactive to the reactive state takes place with a constant rate α > 0, and the opposite transition takes place with a constant rate β > 0. When the particle, starting at x0, hits the target in its reactive state (dashed line), the process ends. TrG marks the random completion time of the gated drift-diffusion process after resetting.

Close modal

To model gating, the target is considered to randomly switch between a reactive state (σ = 1 state in Fig. 2 that resembles R2 in Fig. 1) and a non-reactive state (σ = 0 state in Fig. 2 that resembles R2 in Fig. 1). The conversion from the non-reactive to the reactive state happens with a constant rate α > 0, and that from the reactive to the non-reactive state happens with a constant rate β > 0 (Fig. 2). Therefore, the reactive occupancy of the target, i.e., the probability of finding the target in its reactive state is pr := α/(α + β). Similarly, the non-reactive occupancy, or the probability that the target is in its non-reactive state is pnr:= (1 − pr) = β/(α + β). In analogy to the chemical reaction, the process ends only when the particle hits the target in its reactive state. When it hits the target in its non-reactive state, it simply gets reflected and continues to diffuse.

As mentioned in Sec. I, the unbinding of the catalyst C from R1 can be interpreted as resetting at x0. For simplicity, here we consider Poissonian resetting with a constant rate r. In the gated drift-diffusion scenario, this means that the particle is taken back to x0 after stochastic intervals of time, taken from an exponential waiting time distribution with a mean r−1. Note that here we assume that the resetting is instantaneous and that once the particle is reset at x0, it immediately starts moving again. In other words, we neglect any refractory period, i.e., idle time after each resetting event before drift-diffusion resumes, considering that the time-scale of waiting at x0 after reset (which maps to the time required for C to bind R1 in Fig. 1) is much smaller compared to that of either drift-diffusion or resetting. We also assume that the intermittent dynamics of the target are independent of resetting, similar to Ref. 48.

The fundamental quantity of interest here is the random completion time of the gated chemical reaction, i.e., the first-passage time63 of the diffusing particle from x0 to the target placed at the origin. To calculate the mean first-passage time (MFPT), we first need to write the backward Fokker–Planck equation for the survival probability of this system, which is the total probability to find the particle in the interval [0, ) at a time t, provided the initial position is x0. We denote Qσ(t|x0) as the joint survival probability, i.e., the probability that the particle has not been absorbed by the target up to time t, given the initial position x0 and initial target state σ(t = 0). One can then construct the backward Fokker–Planck equations48 in terms of the initial position x0, which now serves as a variable,
Q0(t|x0)t=λQ0(t|x0)x0+D2Q0(t|x0)x02+αQ1(t|x0)Q0(t|x0)+r[Q0(t|xr)Q0(t|x0)],Q1(t|x0)t=λQ1(t|x0)x0+D2Q1(t|x0)x02+βQ0(t|x0)Q1(t|x0)+r[Q1(t|xr)Q1(t|x0)].
(1)
Note that xr in the above-mentioned set of equations indicates the resetting position, which has to be distinguished from the variable x0 initially and, only at the end, has to be set xr = x0 self-consistently. The initial conditions for Eq. (1) are Qσ(0|x0) = 1, and the boundary conditions are Q1(t|0) = 0 and [Q0(t|x0)/x0]x0=0=0, respectively. This indicates that the particle is absorbed at the target when the latter is reactive (σ = 1) and is reflected from the target when it is non-reactive (σ = 0).48 The average survival probability for the gated process can then be calculated by taking contributions from both possibilities,
QrG(t|x0)=prQ1(t|x0)+(1pr)Q0(t|x0).
(2)
Subsequently, we use subscript r and superscript G to indicate resetting and gating, respectively, in Eq. (2) and the rest of the paper. The Laplace transformation of Eq. (2) gives
Q̃rG(s|x0)=prQ1̃(s|x0)+(1pr)Q0̃(s|x0),
(3)
where Q̃rG(s|x0):=0dtestQrG(t|x0) is the Laplace transform of QrG(t|x0) and Q̃σ(s|x0):=0dtestQσ(t|x0) are Laplace transforms of Qσ(t|y), respectively. The average MFPT, our observable of interest in this work, is also defined over the two random possibilities and thus reads
TrG(x0)=prT1(x0)+(1pr)T0(x0),
(4)
where ⟨Tσ(x0)⟩ is the MFPT when the initial state of the target is σ, given by Tσ(x0)=0dtQσ(t|x0)=Q̃σ(s|x0)|s=0, since −∂Qσ(t|x0)/∂t is the associated first-passage time distribution.62,63 Therefore, the average MFPT reads
TrG(x0)=0dtQrG(t|x0)=Q̃rG(s|x0)|s=0.
(5)
For the rest of the paper, we will write TrG instead of TrG(x0) for brevity.
Solving Eq. (1) in the Laplace space, plugging in the solutions, i.e., Q̃σ(s|x0)s, into Eq. (3) to calculate Q̃rG(s|x0), and finally setting s = 0 in the resulting expression of Q̃rG(s|x0) following Eq. (5), we obtain (see  Appendix A for detailed derivation) the explicit expression of the average MFPT that reads
TrG=1reμ1x01+βμ1αμ21r+eμ2x0α+βeμ1x0,
(6)
where μ1=(λ+λ2+4Dr)/2D>0 and μ2=(λ+λ2+4D(α+β+r))/2D>0. Therefore, for pure diffusion with gating, i.e., when λ → 0, μ1=r/D and μ2=(r+α+β)/D, and Eq. (6) boil down to Ref. 48,
TrG=erDx01r+βerDx0αr[r+α+β]1+rer+α+βDx0(α+β).
(7)
Moreover, in the absence of gating, i.e., when β → 0, Eq. (6) reduces to Tr=[exp(x0(λ2+4Drλ)/2D)1]/r, which is the exact expression for the MFPT for ungated drift-diffusion with Poissonian resetting.50 

In Fig. 3, we plot TrG as a function of the resetting rate r for different values of the drift velocity λ, where the reactive occupancy of the target, pr, is kept constant. It is evident from Fig. 3 that when λ > 0, i.e., when the drift acts toward the target, the average MFPT shows a non-monotonic variation with r for lower values of λ, indicating that the introduction of resetting expedites first-passage when the process is diffusion-controlled. In contrast, TrG increases monotonically with r for sufficiently higher values of λ, meaning that the introduction of resetting delays the first-passage when the process is drift-controlled. This trend can be explained in the following way. When diffusion dominates over drift, the particle tends to diffuse away from the target. In such cases, resetting can effectively truncate those long trajectories, which reduces the overall first-passage time. In contrast, when drift dominates over diffusion, the particle tends to execute a directed motion toward the target (λ > 0); resetting can only hinder such transport resulting in a longer completion time. Note that resetting can accelerate the first-passage even when the dynamics are drift-controlled if the drive is away from the target (λ < 0).

FIG. 3.

The average MFPT, TrG, vs the resetting rate r for different values of the drift velocity λ. The lines represent analytical results following Eq. (6), and the symbols represent results from numerical simulations (see  Appendix D for details). The curves with λ > 0 denote cases where the drift acts toward the gated target, and those with λ < 0 denote otherwise. The variation of TrG with r is always non-monotonic for λ ≤ 0, however, for λ > 0, it is non-monotonic for lower values of λ but monotonic for sufficiently high values of λ. Here we take x0 = 2, D = 1, α = 0.5, and β = 0.5 for all cases.

FIG. 3.

The average MFPT, TrG, vs the resetting rate r for different values of the drift velocity λ. The lines represent analytical results following Eq. (6), and the symbols represent results from numerical simulations (see  Appendix D for details). The curves with λ > 0 denote cases where the drift acts toward the gated target, and those with λ < 0 denote otherwise. The variation of TrG with r is always non-monotonic for λ ≤ 0, however, for λ > 0, it is non-monotonic for lower values of λ but monotonic for sufficiently high values of λ. Here we take x0 = 2, D = 1, α = 0.5, and β = 0.5 for all cases.

Close modal

Summarizing, we see that either for pure diffusion or when the drift acts away from the target (λ ≤ 0), the average MFPT consistently shows a non-monotonic variation with r. This means that the introduction of resetting always accelerates the first-passage for λ ≤ 0. Therefore, a hallmark of a resetting transition is apparent for λ > 0, while no such transition is expected for λ ≤ 0. Indeed, similar to ungated diffusive processes under resetting,30,31 the introduction of resetting was shown to be always beneficial for pure diffusive gated processes (λ = 0), and no such transition was observed there.48 Here, we focus on the scenario when the drift acts toward the target and then reveal the physical conditions under which a resetting strategy turns out to be beneficial. In passing, we will also briefly discuss a situation where the system is confined between two boundaries (one additional reflecting boundary apart from the stochastically gated target). In analogy to a chemical reaction, the reflecting boundary is often used to mimic high activation energy barriers in reaction coordinates. We refer to  Appendix B for this discussion, where we investigate the role of resetting in detail.

The resetting transition is traditionally captured by the optimal resetting rate (ORR, denoted r), defined as the rate of resetting that minimizes the average MFPT. Figure 3 reveals that for pure diffusion (λ = 0), the optimal resetting rate has a certain positive value (denoted r=r0, not marked in Fig. 3). With an increase in the drift toward the target, ORR gradually decreases to finally become zero at a critical value of λ (denoted λc, not shown in Fig. 3), which marks the point of resetting transition. If we continue to increase λ beyond λc, ORR remains zero. Note that when the drift acts away from the target (λ < 0), r increases as that drift becomes stronger. The optimal resetting rate r thus acts as an order parameter, in the same spirit as in classical phase transitions, to explore the resetting transition. Since ORR minimizes TrG, it can be calculated from the relation dTrG/dr|r=r=0, which leads to a complicated transcendental equation that cannot be solved analytically. Solving the same numerically, we calculate r, the optimal resetting rate for λ > 0. In a similar manner, the optimal resetting rate for pure diffusion (for λ = 0, denoted r0) is also obtained in order to calculate the scaled ORR, r/r0.

In Fig. 4, we plot the scaled ORR with respect to λ for different values of the reactive occupancy pr (we keep α constant and tune pr by solely changing β). The non-zero values of the scaled ORR for λ < λc in Fig. 4 show that resetting accelerates the first-passage in that regime. In stark contrast, for λλc, the scaled ORR is zero, which shows that resetting cannot accelerate the first-passage in that regime. For the ungated (pr = 1) process, λc = 1 for our choice of parameters, which is in exact agreement with earlier literature.50 It is evident from Fig. 4 that λc decreases when pr is decreased below unity, which means that resetting expedites first-passage time up to a critical drift (which is essentially smaller than λc for the ungated process) when gating is introduced to the system.

FIG. 4.

The scaled optimal resetting rate, r/r0, vs λ for different values of pr. Resetting transition in each case is observed at λ = λc, where the scaled ORR becomes zero, marked by dashed lines of the same color as the curve. For λ < λc, resetting expedites transport, whereas for λλc, it cannot. Here we take D = 1, x0 = 2, and α = 0.5 [which leads to pr = 1/(2β + 1)] for all cases. For ungated drift-diffusion (given by pr = 1, since β → 0), the resetting transition is observed at λc = 1 (gray curve). For gated drift-diffusion with pr < 1, λc decreases below unity.

FIG. 4.

The scaled optimal resetting rate, r/r0, vs λ for different values of pr. Resetting transition in each case is observed at λ = λc, where the scaled ORR becomes zero, marked by dashed lines of the same color as the curve. For λ < λc, resetting expedites transport, whereas for λλc, it cannot. Here we take D = 1, x0 = 2, and α = 0.5 [which leads to pr = 1/(2β + 1)] for all cases. For ungated drift-diffusion (given by pr = 1, since β → 0), the resetting transition is observed at λc = 1 (gray curve). For gated drift-diffusion with pr < 1, λc decreases below unity.

Close modal

In order to better understand how the critical value of λ changes with the reactive occupancy of the target, we next numerically calculate λc as a function of pr. In Fig. 5, we construct a phase diagram spanned by the reactive occupancy pr and the drift velocity λ, where λc acts as the separatrix that divides the entire phase space into two parts: one where resetting expedites first-passage (the white regime) and the other where it cannot (the gray regime). We can recover the core results observed in Fig. 4 from Fig. 5 in the following way. For each value of pr ∈ [0, 1] (encountered by moving horizontally through Fig. 5), the dynamics is diffusion-controlled and resetting is beneficial if λ < λc, whereas the dynamics is drift-controlled and resetting turns out to be non-beneficial if λλc. It is clear from Fig. 5 as well that with an increase in reactive occupancy, λc increases to finally become unity for the ungated process (pr = 1). Figure 5 is, therefore, a complete yet compact representation of the condition for resetting to expedite gated drift-diffusion. Next, we discuss an alternative approach that can successfully generate this phase diagram by carefully exploring the resetting criterion in the limit r → 0.

FIG. 5.

A phase diagram of pr vs λ based on the qualitative effect of resetting on gated drift-diffusion. The black line represents the condition for resetting transition (λc), which divides the entire phase space into two parts. For λ < λc, resetting expedites transport (white regime), whereas for λλc, resetting fails to expedite transport (gray regime). Here we take D = 1, x0 = 2, and α = 0.5 [i.e., pr = 1/(2β + 1)] for all cases. For the ungated process (pr = 1), λc = 1, and it decreases with pr. The colored discs on the black line present the cases shown in Fig. 4. Following the analysis of TrG in the limit r → 0 [see Eqs. (8) and (10)], the separatrix (black line) is also obtained by plotting f = 0. Resetting is beneficial for f < 0 (the white regime) but not for f > 0 (the gray regime).

FIG. 5.

A phase diagram of pr vs λ based on the qualitative effect of resetting on gated drift-diffusion. The black line represents the condition for resetting transition (λc), which divides the entire phase space into two parts. For λ < λc, resetting expedites transport (white regime), whereas for λλc, resetting fails to expedite transport (gray regime). Here we take D = 1, x0 = 2, and α = 0.5 [i.e., pr = 1/(2β + 1)] for all cases. For the ungated process (pr = 1), λc = 1, and it decreases with pr. The colored discs on the black line present the cases shown in Fig. 4. Following the analysis of TrG in the limit r → 0 [see Eqs. (8) and (10)], the separatrix (black line) is also obtained by plotting f = 0. Resetting is beneficial for f < 0 (the white regime) but not for f > 0 (the gray regime).

Close modal
Revisiting Fig. 3, we see that it clearly indicates that when the initial (in the limit r → 0) slope of the TrG vs r curve is negative, the introduction of resetting proves itself beneficial by decreasing the average MFPT. In contrast, a positive slope of such a curve in the limit r → 0 suggests that the introduction of resetting increases the average MFPT there. This motivates us to explore the condition for resetting to accelerate gated drift-diffusion by analyzing the expression of the average MFPT in the limit r → 0. To do that, we first expand TrG in r for an infinitesimal resetting rate to obtain
TrGTG+rTrGrr=0+O(r2),
(8)
where ⟨TG⟩ is the average MFPT in the absence of resetting. Following Eq. (6), we get (see  Appendix C for an alternative derivation)
TG=1λx0+2βDα4αD+4βD+λ2λ.
(9)
Note that in the absence of gating (pr = 1, or β = 0), Eq. (9) reduces to ⟨T⟩ = x0/λ,63 which implies that ⟨TG⟩ > ⟨T⟩, since the second term in the right hand side of Eq. (9) is always positive.
The expression for the second term in the right hand side of Eq. (8) is fairly complicated; here, we write it in a simpler form by introducing some new parameters, viz., γ := λ2/2D, Pe := x0λ/2D, and κ:=1+[4D(α+β)/λ2]1, such that
f:=TrGrr=0=β2γ2α2Pe1κ2κ2(κ+1)+2γeκPeκ(α+β)+12γ2Pe(Pe1).
(10)
Note that Pe in Eq. (10) is the Péclet number, i.e., the ratio between the rate of driven transport and that of diffusive transport, and γ−1 is the fastest first-passage time (smallest decay time) in the strong drift limit, as was pointed out by Redner in Ref. 63.

It is evident from Eq. (8) that in the limit r → 0, resetting is expected to expedite the completion of the process, i.e., TrG<TG, when f < 0. This is a sufficient condition (though it may not be necessary) for resetting to be useful. When f > 0, however, resetting is expected to delay the completion of the process, i.e., TrG>TG. Therefore, the condition f = 0 should divide the entire phase space created by (λ, pr) into two parts: one where resetting is beneficial (f < 0) and the other where it is not (f > 0). Indeed, when we plot f = 0 following Eq. (10) in the same phase diagram presented in Fig. 5, it exactly overlaps the existing separatrix plotted earlier by calculating the critical drift λc as a function of pr. Therefore, the condition f < 0 marks the phase where the introduction of resetting accelerates transport to the target (the white regime), while f > 0 marks the phase where the introduction of resetting delays the same (the gray regime), as expected. Revisiting Eq. (10), we note that in the limit of pr → 1 (for β → 0), the first term of Eq. (10) vanishes. Then, f < 0 boils down to Pe < 1 (meaning Pe = 1 is the resetting transition point), the condition where resetting accelerates ungated drift-diffusion, as obtained in earlier works.50,51,55

The phase diagram in Fig. 5 is generated only for a fixed value for α. Next, we perform a similar exercise for other values of α and display the results in Fig. 6. It is evident from Fig. 6 that the separatrix, i.e., the phase boundary that separates the two phases—the “resetting-beneficial” phase at the left and the “resetting-detrimental” phase at the right—varies with α. In fact, for larger values of α, the separatrix divides the phases in such a way that the “resetting-beneficial” phase becomes considerably smaller and the “resetting-detrimental” phase occupies most of the phase space, implying that the effect of resetting becomes rather constrained in that limit. Next, we examine two important limits of the gating rates, viz., α → 0 and α, β.

FIG. 6.

A phase diagram of pr vs λ for different values of α. Each phase boundary (obtained for a certain value of α, shown by the curves) divides the phase space into a “resetting-beneficial” phase (left to the curve) and a “resetting-detrimental” phase (right to the curve). For large values of α, the “resetting-beneficial” phase becomes considerably smaller as the “resetting-detrimental” phase occupies the majority of the phase space.

FIG. 6.

A phase diagram of pr vs λ for different values of α. Each phase boundary (obtained for a certain value of α, shown by the curves) divides the phase space into a “resetting-beneficial” phase (left to the curve) and a “resetting-detrimental” phase (right to the curve). For large values of α, the “resetting-beneficial” phase becomes considerably smaller as the “resetting-detrimental” phase occupies the majority of the phase space.

Close modal
The limit α → 0 essentially implies that the target is reflective almost all the time. In what follows, we will show that this is a delicate limit and should be handled carefully. Strictly speaking, the limit α → 0 should be interpreted as βα, which means that the target has a higher probability of remaining non-reactive than being reactive. Using this limit in Eq. (6), one finds
TrG=1reμ1x01+βμ1rαμ2eμ1x0,
(11)
where μ1=(λ+λ2+4Dr)/2D>0 and μ2=(λ+λ2+4D(α+β+r))/2D>0, as before. Moreover, one can disregard the first term in the right hand side of Eq. (11) for the finite resetting rate r (assuming βr) to find
TrG=β4Dr+λ2λex04Dr+λ2λ2Dαr4βD+λ2λ.
(12)
To understand the behavior of the average MFPT, we plot TrG as a function of the resetting rate in Fig. 7 for large β and small α keeping β/α ≫ 1. Intriguingly, we find that in this limit, TrG shows both monotonic and non-monotonic behavior as one varies r for different λ. In particular, the latter case implies that there exists a resetting rate for which TrG becomes optimally minimum. To find this optimal resetting rate, we set dTrGdrr=r=0 and obtain
r=Dx02λx0,
(13)
which is a simple function of the diffusion constant, initial position, and drift. The linear behavior of r with respect to the drift variable λ is also noteworthy. Finally, setting λ = 0, one recovers r=D/x02, which was obtained in Ref. 48.
FIG. 7.

Monotonic and non-monotonic behavior of the MFPT in the limit α → 0 (i.e., β/α ≫ 1), as obtained from Eq. (12). The non-monotonic behavior gradually vanishes as λ goes beyond the resetting transition point λc = D/x0 = 0.5. This can be obtained by setting r in Eq. (13) to zero.

FIG. 7.

Monotonic and non-monotonic behavior of the MFPT in the limit α → 0 (i.e., β/α ≫ 1), as obtained from Eq. (12). The non-monotonic behavior gradually vanishes as λ goes beyond the resetting transition point λc = D/x0 = 0.5. This can be obtained by setting r in Eq. (13) to zero.

Close modal

The appearance of an ORR in the limit α → 0, i.e., when the target is poorly reactive (the so-called cryptic regime20,21), is counter-intuitive in contrast to the case of α = 0 (a purely reflective boundary). It can be argued that a diffusing particle usually makes several encounters (also aided by drift) with the target regardless of the target’s state. In the current context, although most of the time the particle may remain unsuccessful in finding the target in a reactive state, it can still get absorbed whenever there is an element of chance for the target to become reactive. More details about such cryptic targets and their natural appearances in chemical, biological, and ecological systems can be found in Refs. 2, 20, 52, and 53.

In the limit α, β, recalling Eq. (10) we can approximate κ4D(α+β)/λ. Therefore, one can safely neglect the terms of order O(1κ2) including the exponential term. Under this assumption, setting f = 0 in Eq. (10) yields an exact expression for the critical drift λc that reads
λc=2Dx0D+x0αβα+βD2D+x0αβα+βD.
(14)
We notice that even at this limit, pr does not solely control the dynamics of the system. More from the physical point of view, one can refer to this limit as the partially reactive boundary, where the target switches between the reactive and non-reactive states so fast (i.e., the time scale of such a switch is much smaller compared to the time scale of drift-diffusion) that the particle feels the average state of the target and interacts with it with a certain probability all the time (see also Refs. 2 and 20).

So far, we have performed a detailed analysis to understand the effect of resetting on the dynamics of gated drift-diffusion. In Sec. IV, we turn our attention to the maximal speed-up that can be gained by resetting the process at an optimal rate.

The maximal speedup, i.e., the speedup rendered by optimal resetting rate r, is generally defined as the ratio of the MFPT of the original (underlying) process without resetting to that of the process with optimal resetting. Therefore, setting r = r in Eq. (6) and utilizing Eq. (9), we obtain the maximal speedup for the gated drift-diffusion process in a straightforward way, which reads
TGTrG=r(α+β)(2Dβ+x0αμ2)λrβμ1ex02Dμ1+μ2+α+βex0μ12D(βμ1+αμ2)αμ2forλ<λc,1forλλc,
(15)
where μ1=μ1(r) and μ2=μ2(r), μ1 and μ2 having the expressions given after Eq. (6). In Fig. 8, we plot TG/TrG for different values of the reactive occupancy pr. Figure 8 indicates that the maximal speedup for gated drift-diffusion is most marked when drift toward the target is negligible. With an increase in λ, it gradually decreases to finally become unity at the point of resetting transition, λc. We see that when pr = 1, i.e., in the absence of gating, the resetting transition is observed at λc = 1 for our choice of parameters,50 but when pr is decreased below unity, the transition is observed for lower values of λc, as observed earlier in Fig. 5.
FIG. 8.

The maximal speedup for the gated process with resetting compared to the gated process without resetting, TG/TrG, vs the drift velocity λ, for different values of the reactive occupancy, pr. The vertical dashed lines mark the points of resetting transitions for curves of the same color, denoted λc, such that TG/TrG>1 for λ < λc, and TG/TrG=1 at λλc. We take D = 1, x0 = 2, and α = 0.5 [i.e., pr = 1/(2β + 1)] for all cases. In the absence of gating (pr = 1, gray curve), the resetting transition is observed at λc = 2D/x0 = 1, and λc decreases when gating is introduced (pr < 1).

FIG. 8.

The maximal speedup for the gated process with resetting compared to the gated process without resetting, TG/TrG, vs the drift velocity λ, for different values of the reactive occupancy, pr. The vertical dashed lines mark the points of resetting transitions for curves of the same color, denoted λc, such that TG/TrG>1 for λ < λc, and TG/TrG=1 at λλc. We take D = 1, x0 = 2, and α = 0.5 [i.e., pr = 1/(2β + 1)] for all cases. In the absence of gating (pr = 1, gray curve), the resetting transition is observed at λc = 2D/x0 = 1, and λc decreases when gating is introduced (pr < 1).

Close modal
Next, we compare TrG to T, the MFPT for ungated drift-diffusion without resetting, to explore whether it is possible to overcome the increase in the MFPT due to gating by resetting the process in an optimal way. Recalling that the MFPT of ungated drift-diffusion is given by ⟨T⟩ = x0/λ and utilizing Eq. (6) for r = r as before, we get
TTrG=rx0α(α+β)μ2λrβμ1ex02Dμ1+μ2+α+βex0μ12D(βμ1+αμ2)αμ2forλ<λc,x0αμ22Dβ+x0αμ2forλλc.
(16)
Plotting T/TrG as a function of λ in Fig. 9 for different values of pr, we see that the maximal speedup compared to the original ungated process is infinite when there is no drift toward the target and decreases with an increase in λ, as expected. In fact, Fig. 9 clearly shows that for sufficiently low values of λ, optimal resetting can make the process even >10 times faster! It proves that resetting is indeed a useful strategy to compensate for the delay due to gating, and when the dynamics is diffusion-controlled, it can even improve the rate of transport (which is inversely proportional to the mean completion time) beyond the original ungated process without resetting. It is also observed from Fig. 9 that in the absence of gating (when pr = 1), the minimal possible value for T/TrG is unity, which is achieved for λλc.50 In contrast, when pr < 1, T/TrG is reduced below unity even before the resetting transition sets in. Therefore, denoting λc0 as the critical value of λ (marked in Fig. 9 by the colored discs) where T/TrG becomes unity for a certain pr, we observe that λc0λc. The equality holds only for the ungated process, and the difference between λc0 and λc is prominent for lower values of pr. These observations lead us to identify all the possible distinct regimes where resetting can benefit the completion of the gated drift-diffusion process. In what follows, we construct a comprehensive phase diagram in the parameter space encapsulating all these effects of resetting.
FIG. 9.

The maximal speedup for the gated process with resetting compared to the ungated process without resetting, T/TrG, vs λ, for different values of pr. The vertical dashed lines mark the points of resetting transition (λc) for curves of the same color, whereas the colored discs mark the values of λc0, such that optimal resetting expedites the gated process beyond the original ungated process only when λ<λc0. Here D = 1, x0 = 2, and α = 0.5 [i.e., pr = 1/(2β + 1)] for all cases. In the absence of obtaining (pr = 1, gray curve), the point of resetting transition (λc = 2D/x0 = 1) coincides with λc0.

FIG. 9.

The maximal speedup for the gated process with resetting compared to the ungated process without resetting, T/TrG, vs λ, for different values of pr. The vertical dashed lines mark the points of resetting transition (λc) for curves of the same color, whereas the colored discs mark the values of λc0, such that optimal resetting expedites the gated process beyond the original ungated process only when λ<λc0. Here D = 1, x0 = 2, and α = 0.5 [i.e., pr = 1/(2β + 1)] for all cases. In the absence of obtaining (pr = 1, gray curve), the point of resetting transition (λc = 2D/x0 = 1) coincides with λc0.

Close modal

To construct the complete phase diagram for the problem, we revisit Figs. 5 and 8 and recall that the entire phase space [spanned by (λ, pr)] is divided into two parts, viz., TrG<TG (i.e., where optimal resetting expedites transport) and TrGTG (i.e., where optimal resetting cannot expedite transport), and the transition between these two phases takes place at a critical point λ = λc. The study of the maximal speedup of the gated process with resetting compared to the ungated process without resetting in Sec. IV suggests that we can further divide the former phase into two parts: one where the rate of transport for the gated process with optimal resetting is higher than that of the original ungated process, i.e., TrG<T, and the other where it is not, i.e., TrGT. The transition between these two phases happens at λ=λc0λc. Since gating essentially makes drift-diffusion slower in the absence of resetting, i.e., T<TG [see Eq. (9)], summarizing our observations, we construct a complete phase diagram for the present problem (displayed in Fig. 10), which consists of three distinct phases: (i) phase I: when optimal resetting makes the gated process faster than the original ungated (and hence the original gated) process, given by TrG<T<TG, (ii) phase II: when optimal resetting makes the gated process faster than the original gated process but not the original ungated process, given by TTrG<TG, and (iii) phase III: when resetting cannot make the gated process faster than the original gated (and hence the original ungated) process, given by T<TGTrG. The transition points λc0 create the separatrix between phases I and II, whereas the transition points λc create that between phases II and III. Since λc0=λc for pr = 1, in Fig. 10, we find phases I and II to merge together in the absence of gating. This diagram in the phase space of two important parameters of the system, namely the reactive occupancy and the bias, allows us to delineate the exact nature of resetting in the process of completion. In other words, we can gain maximal benefits from a precise and a priori knowledge of the parameter space.

FIG. 10.

A complete phase diagram of pr vs λ shows three distinct phases: (i) phase I: where optimal resetting enhances the rate of gated drift-diffusion beyond the original (without resetting) ungated process, given by TrG<T<TG, (ii) phase II: when optimal resetting improves the rate of the gated process but not compared to the original ungated process, given by TTrG<TG, and (iii) phase III: when resetting cannot improve the rate of the gated process, given by T<TGTrG. The horizontal colored lines mark the cases shown in Fig. 9. Here, we consider α = 0.5 [such that pr = 1/(2β + 1)], D = 1, and x0 = 2. Phases I and II merge together at λc = 2D/x0 = 1, the point of resetting transition for drift-diffusion in the absence of gating (pr = 1).

FIG. 10.

A complete phase diagram of pr vs λ shows three distinct phases: (i) phase I: where optimal resetting enhances the rate of gated drift-diffusion beyond the original (without resetting) ungated process, given by TrG<T<TG, (ii) phase II: when optimal resetting improves the rate of the gated process but not compared to the original ungated process, given by TTrG<TG, and (iii) phase III: when resetting cannot improve the rate of the gated process, given by T<TGTrG. The horizontal colored lines mark the cases shown in Fig. 9. Here, we consider α = 0.5 [such that pr = 1/(2β + 1)], D = 1, and x0 = 2. Phases I and II merge together at λc = 2D/x0 = 1, the point of resetting transition for drift-diffusion in the absence of gating (pr = 1).

Close modal

In this work, we performed an in-depth analysis of the completion time statistics of drift-diffusive transport to a stochastically gated target in the presence of Poissonian resetting. In particular, we strategically explored the conditions where resetting can enhance the rate of such transport, as has been shown for ungated processes where resetting stabilizes the non-equilibrium motion30,45,64–66 by removing the detrimental long trajectories that result in a slower transport rate. Projecting the general problem of gated drift-diffusion with resetting to a gated chemical reaction initiated by a catalyst (as discussed in Fig. 1), the main results of the present work can be interpreted as follows.

We observed that the rate of product formation depends on an interesting interplay between the chemical potential drive that governs the reaction (λ), the probability (pr) that the gated reactant stays in its activated state (when R2 exists as R2), and the rate of unbinding (or resetting, with rate r) of the catalyst C from CR1. When the chemical potential drive toward the product (λ > 0) is low/moderate such that the reaction is diffusion-controlled, the rate of reaction is maximized for an optimal unbinding rate (r) of the catalyst. In contrast, when the drive λ is strong, i.e., the reaction is drift-controlled, the unbinding of the catalyst C from CR1 decreases the rate of reaction. A transition is thus observed at a critical drive, λc, which grows with pr and becomes maximal for pr = 1, i.e., for the ungated reaction. Strikingly enough, we observed that for λ<λc0 (when λc0λc is another critical value of λ that increases with pr and attains a maximum λc0=λc at pr = 1), optimal unbinding with a rate r can make the reaction even >10 times faster compared to the ungated reaction in the limit r → 0 (i.e., where the binding step is almost irreversible).

These observations lead to a complete phase diagram based on the qualitative and quantitative effect of optimal unbinding (resetting) on a gated chemical reaction (modeled by drift-diffusion to a gated target) that consists of three distinct phases. Recalling that60 the rate of product formation ∝(the mean completion time of reaction)−1, these three phases are identified through the following conditions: (i) where TrG<T<TG, i.e., where the rate of gated chemical reaction is enhanced by optimal unbinding of catalyst beyond that of ungated/gated reactions when the binding is almost irreversible [r → 0], (ii) where TTrG<TG, i.e., when optimal unbinding improves the rate of gated reaction but not beyond the ungated reaction in the limit r → 0, and (iii) where T<TGTrG, i.e., when unbinding fails to make the gated reaction faster than either of the gated/ungated reactions for almost irreversible binding.

The model considered here generally applies to gated drift-diffusion under the influence of resetting. The major advantage, besides its analytical tractability, is that one can also gain deep insights about the intricate trade-offs between gating and resetting mechanisms, both of which are essential components of chemical reaction networks. A generalization of this simple model to a generic space-dependent diffusion process in an arbitrary energy landscape in the presence of gated targets would be a potential research avenue. A detailed numerical analysis to this end would be a worthwhile pursuit. Notably, such theoretical models can capture physical situations arising in experiments that study, e.g., completion time statistics of protein folding by gated fluorescence quenching. There, the protein is tagged/labeled by a fluorophore that reversibly binds the protein (unbinding is similar to resetting) to impart fluorescence properties.67 Once the tagged protein folds to its native state, the quencher selectively reacts with the active site of that folded protein in its fluorescent state, provided that site is in its open (exposed) conformation. If the active site of the folded protein remains in a closed (hidden) conformation, the quencher fails to react with it, which implicates gating. A successful reaction thus occurs only in the exposed conformation, which leads to subsequent quenching of fluorescence, thereby marking the completion of the folding process.68 We believe that our work can shed light on understanding and harnessing the various gating and resetting protocols inherent to such systems.

A.P. gratefully acknowledges research support from the DST-SERB Start-up Research Grant No. SRG/2022/000080 and the Department of Atomic Energy, Government of India. D.M. acknowledges SERB (Project No. ECR/2018/002830/CS), DST, Government of India for financial support, and IIT Tirupati for the new faculty seed grant. S.R. acknowledges the Elizabeth Gardner Fellowship by the School of Physics and Astronomy, University of Edinburgh, and the INSPIRE Faculty research grant by DST, Government of India, executed at IIT Tirupati. The numerical calculations reported in this work were carried out on the Nandadevi cluster, which is maintained and supported by IMSc’s High-Performance Computing Center. We acknowledge the anonymous Reviewers for their insightful remarks.

The authors have no conflicts to disclose.

Arup Biswas: Data curation (lead); Formal analysis (equal); Methodology (equal); Writing – original draft (supporting); Writing – review & editing (supporting). Arnab Pal: Formal analysis (equal); Investigation (equal); Methodology (lead); Supervision (equal); Writing – review & editing (equal). Debasish Mondal: Formal analysis (supporting); Visualization (equal); Writing – original draft (supporting); Writing – review & editing (supporting). Somrita Ray: Conceptualization (lead); Formal analysis (lead); Investigation (lead); Supervision (lead); Visualization (lead); Writing – original draft (lead); Writing – review & editing (equal).

The data that support the findings of this study are available within the article, its appendixes, and in Ref. 69.

Here, we provide the solution of Eq. (1) in the Laplace space. Following that, we calculate the mean first passage time for a diffusing particle with drift, starting from an initial position x0, to reach the gated target. We start by Laplace transforming Eq. (1),
D2Q̃0(s|x0)x02λQ̃0(s|x0)x0(s+α+r)Q̃0(s|x0)+αQ̃1(s|x0)=1rQ̃0(s|xr),D2Q̃1(s|x0)x02λQ̃1(s|x0)x0(s+β+r)Q̃1(s|x0)+βQ̃0(s|x0)=1rQ̃1(s|xr),
(A1)
where Q̃σ(s|y):=0dtestQσ(t|y) denote the Laplace transform of Qσ(t|y). Equation (A1) is a second order, linear, and non-homogeneous differential equation. Considering
Q̃σ(s|x0)=Q̃σh(s|x0)+Q̃σinh(s|x0),
(A2)
where Q̃σh(s|x0) and Q̃σinh(s|x0) denote the homogeneous and inhomogeneous parts of Q̃σ(s|x0), respectively, we can rewrite Eq. (A1) in two separate parts. The homogeneous part reads
D2Q̃0h(s|x0)x02λQ̃0h(s|x0)x0(s+α+r)Q̃0h(s|x0)+αQ̃1h(s|x0)=0,D2Q̃1h(s|x0)x02λQ̃1h(s|x0)x0(s+β+r)Q̃1h(s|x0)+βQ̃0h(s|x0)=0.
(A3)
Similarly, the inhomogeneous part reads
(s+α+r)Q̃0inh(s|x0)+αQ̃1inh(s|x0)=1rQ̃0(s|xr),(s+β+r)Q̃1inh(s|x0)+βQ̃0inh(s|x0)=1rQ̃1(s|xr),
(A4)
which is a set of algebraic equations. Solving Eq. (A4), we obtain
Q̃0inh(s)=1s+r1+rs+r+α+β×αQ̃1(s|xr)+(s+r+β)Q̃0(s|xr),Q̃1inh(s)=1s+r1+rs+r+α+β×βQ̃0(s|xr)+(s+r+α)Q̃1(s|xr).
(A5)
We note that Q̃σinh(s) depends on xr and not on x0. Next, we proceed to solve Eq. (A3). Noting that xr does not appear in Eq. (A3), we simply write Q̃σh(s|x0)Q̃σh for notational convenience. Writing Eq. (A3) in matrix form, we find
D2x02Q̃0hQ̃1hλx0Q̃0hQ̃1h+(s+α+r)αβ(s+β+r)Q̃0hQ̃1h=0.
(A6)
Taking Ψ=Q̃0hQ̃1hT, we rewrite Eq. (A6) as follows:
D2x02Ψλx0Ψ+AΨ=0,
where
A=(s+α+r)αβ(s+β+r).
(A7)
We now choose Ψ=Φemx0 as the trial solution of Eq. (A7), which generates the characteristic equation Dm2Φ − λmΦ + AΦ = 0, which gives
Dm2λm(s+α+r)αβDm2λm(s+β+r)Φ=0.
(A8)
The roots of Eq. (A8) can be found as
m1=λλ2+4D(s+r)2D,m2=λλ2+4D(α+β+s+r)2D,m3=λ+λ2+4D(s+r)2D,m4=λ+λ2+4D(α+β+s+r)2D.
(A9)
A close inspection of the above-mentioned roots reveals that m1 and m2 are negative, while m3 and m4 are positive (since D, s, r > 0). Since Q̃σhemx0, and Q̃σ(s|x0)=1/s for x0 [because the survival probability Qσ(t|x0)|x0=1 and its Laplace transform is 1/s], we select only m1 and m2 as the plausible roots.
Letting Φ1 denote the eigenvector corresponding to m1 and utilizing Eq. (A8), we get Φ1=11. In a similar manner, the eigenvector corresponding to m2 is given by Φ2=α/β1. The general solution of Eq. (A7) thus reads Ψ=c1Φ1em1x0+c2Φ2em2x0, and subsequently
Q̃0h=c1em1x0αβc2em2x0,
(A10)
Q̃1h=c1em1x0+c2em2x0,
(A11)
where c1 and c2 are constants to be determined in the following. To this end, we use the boundary condition Q0(t|x0)x0|x0=0=0 [equivalently, Q̃0(s|x0)x0|x0=0=0], which results in Q̃0h(s|x0)x0|x0=0=0, since Q̃σinh(s) does not depend on x0. Applying this in Eq. (A10) results in
c2=βαc1m1m2.
(A12)
To compute c1, we recall the other boundary condition (absorbing): Q1(t|0) = 0 [equivalently, Q̃1(s|0)=0]. Combining Eqs. (A5) and (A11) along with the boundary condition at x0 = 0, we can write
Q̃1(s|0)=c1+βαm1m2c1+1s+rrs+r+α+β×βQ̃0(s|xr)+(s+r+α)Q̃1(s|xr)+1=0.
(A13)
Incorporating Eq. (A12) in Eq. (A13) and solving for c1 and hence c2 finally gives
c1=αm2(αm2+βm1)(s+r)1+rs+r+α+β×[βQ̃0(s|xr)+(s+r+α)Q̃1(s|xr)],c2=βm1(αm2+βm1)(s+r)1+rs+r+α+β×βQ̃0(s|xr)+(s+r+α)Q̃1(s|xr).
(A14)
Plugging in everything together into Eq. (A2), we find
Q0̃(s|x0)=c1em1x0m1m2c1em2x0+1s+r1+rs+r+α+β×αQ̃1(s|xr)+(s+r+β)Q̃0(s|xr),Q1̃(s|x0)=c1em1x0+βαm1m2c1em2x0+1s+r1+rs+r+α+β×βQ̃0(s|xr)+(s+r+α)Q̃1(s|xr),
(A15)
which are written in terms of Q̃σ(s|xr). Setting xr = x0 in Eq. (A15) in a self-consistent manner, we find the exact expressions for the survival functions
Q0̃(s|x0)=(βm1+αm2)+m1em2x0α+r(α+β)α+β+sαm2em1x0βm1rsem2x0α+β+s+αm2rem1x0+βm1s+αm2s,Q1̃(s|x0)=(α+β+s)αm2em1x01+βm1em2x01(α+β+s)αm2rem1x0+βm1s+αm2s+βm1rsem2x0.
(A16)
The averaged survival probability can be found by substituting Eq. (A16) into Eq. (3). This results in
Q̃rG(s|x0)=βm1rem2x0α+β+s+1+αm21em1x0βm1rsem2x0α+β+s+αm2rem1x0+βm1s+αm2s.
(A17)
Generically, Eq. (A17) can be used to derive all the first passage time moments. The observable of our interest in this problem, for example, is that the averaged MFPT reads TrG=Q̃rG(s|x0)|s=0.62 This results in Eq. (6) in the main text.
Alternatively, we can get Eq. (6) from Eq. (A15) by calculating individual mean first passage times conditioned on the initial state of the target state. To this end, let us denote TσG(x0) as the first-passage time to reach the target at the origin starting from position x0 with the initial target state being at σ. Using TσG(x0)=Qσ̃(s|x0)|s=0 and setting s → 0 in Eq. (A15), we get
T1G(x0)=1reμ1x01+1rβμ1αμ2eμ1x01eμ2x0,T0G(x0)=1reμ1x01+1rμ1μ2eμ1x0eμ2x01+rα+βα,
(A18)
where μ1 := −m1|s=0 > 0 and μ2 := −m2|s=0 > 0. Finally, plugging in Eq. (A18) into Eq. (4) in the main text, we obtain Eq. (6).

Here we consider the case of a bounded system, i.e., where the particle remains in a finite confinement. This is also highly relevant in the context of chemical reactions since a high energy barrier can mimic a reflecting boundary (in the reaction coordinate space) that pushes the particle away from it. We construct this finite domain by considering the same set-up as in the main text, with an additional reflecting wall at x = L > x0. If the particle hits the wall, it gets reflected back. Intuitively, the barrier or the reflecting boundary prevents the particle from going too far from the target placed at the origin. This is in sharp contrast to the semi-infinite case, where the particle is allowed to diffuse away from the target. This leads to a few key changes in the dynamics that are reflected in the average MFPT.

On the technical ground, we can find the survival probability in Laplace space using the same method as discussed in  Appendix A with the new boundary condition Qσ(t|x0)x0|x0=L=0. For this reason, all the eigenvalues will exist unlike in the previous case. In particular, one can show that the eigenvector corresponding to m3 is the same as m1, i.e., Φ1=11, and that of m4 is the same as m2, i.e., Φ2=α/β1. Recalling the decomposition Q̃σ(s)=Q̃σh(s)+Q̃σinh(s) from Eq. (A2), we first try to obtain the solutions for the homogeneous part. As before taking Ψ=Q̃0hQ̃1hT and using Eq. (A7) we find
Ψ=c1Φ1em1x0+c2Φ2em2x0+c3Φ1em3x0+c4Φ2em4x0,
(B1)
so that
Q̃0h=c1em1x0αβc2em2x0+c3em3x0αβc4em4x0,
(B2)
Q̃1h=c1em1x0+c2em2x0+c3em3x0+c4em4x0.
(B3)
The inhomogeneous part Q̃σinh(s) has the same solution as given in Eq. (A5). In addition to the boundary conditions Q̃1(s|0)=0 and Q̃0h(s|x0)x0|x0=0=0 at the gated target, we also have two additional boundary conditions, namely Q̃0(s|x0)x0|x0=L=0 and Q̃1(s|x0)x0|x0=L=0. These four boundary conditions give four linear equations
c1+c2+c3+c4+Q̃1inh(s)=0,c1m1em1L+c2m2em2L+c3m3em3L+c4m4em4L=0,c1m1em1Lαβc2m2em2L+c3m3em3Lαβc4m4em4L=0,c1m1αβc2m2+c3m3αβc4m4=0,
(B4)
which completely determine the constants c1, c2, c3, c4. From this, we can find a closed-form expression for the survival probabilities in Laplace space (and subsequently the MFPT by setting s → 0). The expression for the MFPT is quite lengthy to present here; check69 for the Mathematica file where all the derivations are given. In what follows, we perform a comprehensive analysis of this MFPT and point out the key differences in comparison to those obtained for the semi-infinite domain.

Figure 11 showcases the variation of the MFPT, TrG, as a function of the resetting rate r for different values of the drift λ. One crucial observation is that the non-monotonic behavior of TrG is not always present even when the drift is away from the target (i.e., λ < 0). This is in complete contrast to the semi-infinite case, where resetting is guaranteed to help whenever the drift is away from the target (see Fig. 3). To understand this better, we plot the optimal resetting rate r as a function of λ for various domain sizes L in Fig. 12, which clearly shows that the critical values of λ that mark the resetting transition (denoted λc in the main text; the minimal value of λ for which r = 0) can be negative for considerably smaller domains. With increasing L, however, λc starts to increase, and for sufficiently large values of L, it saturates to the value of λc for the semi-infinite case, as displayed in Fig. 5 of the main text. Simply put, if the reflecting boundary starts moving sufficiently away from the target, the MFPT starts to increase, and resetting renders a more effective search in that case.

FIG. 11.

The average MFPT TrG as a function of the resetting rate r for different values of λ in the case of a bounded domain. Here, the reflecting boundary is placed at L = 3, where the resetting/initial location is at x0 = 2. The colored discs mark the optimal resetting rate (r) in each case. Notably, resetting may not always be helpful (r = 0) even when λ < 0 (e.g., yellow and brown curves).

FIG. 11.

The average MFPT TrG as a function of the resetting rate r for different values of λ in the case of a bounded domain. Here, the reflecting boundary is placed at L = 3, where the resetting/initial location is at x0 = 2. The colored discs mark the optimal resetting rate (r) in each case. Notably, resetting may not always be helpful (r = 0) even when λ < 0 (e.g., yellow and brown curves).

Close modal
FIG. 12.

Main: Variation of ORR (r) as a function of λ for different domain sizes L. For λ < λc, resetting proves itself beneficial, as indicated by the non-zero values of r, whereas for λλc, resetting becomes detrimental, as indicated by r = 0. The resetting transition is thus marked by λc. Inset: Phase diagram with reflecting barrier at L by plotting λc that acts as the separatrix (black line; the colored discs mark the specific cases shown in the main panel) that divides the phase space into two parts: one where resetting is beneficial (white regime) and the other where resetting is detrimental (gray regime). The existence of negative λc essentially implies that resetting can be detrimental even when λ < 0. The dashed horizontal line corresponds to λc = 0.78, obtained for the semi-infinite case (i.e., L), as displayed in Fig. 5 for pr = 0.5. Note that we consider α = 0.5, β = 0.5, and D = 1 for each case in the main panel and in the inset.

FIG. 12.

Main: Variation of ORR (r) as a function of λ for different domain sizes L. For λ < λc, resetting proves itself beneficial, as indicated by the non-zero values of r, whereas for λλc, resetting becomes detrimental, as indicated by r = 0. The resetting transition is thus marked by λc. Inset: Phase diagram with reflecting barrier at L by plotting λc that acts as the separatrix (black line; the colored discs mark the specific cases shown in the main panel) that divides the phase space into two parts: one where resetting is beneficial (white regime) and the other where resetting is detrimental (gray regime). The existence of negative λc essentially implies that resetting can be detrimental even when λ < 0. The dashed horizontal line corresponds to λc = 0.78, obtained for the semi-infinite case (i.e., L), as displayed in Fig. 5 for pr = 0.5. Note that we consider α = 0.5, β = 0.5, and D = 1 for each case in the main panel and in the inset.

Close modal

To elaborate this further, one can expand the MFPT (for the finite domain) in the limit of a small resetting rate r → 0 and find the first order correction in r [in a similar spirit as in Eq. (8)—see the discussion for the semi-infinite case in Sec. III, particularly around Eq. (10)]. The arguments on the function f as discussed there still hold for the present case (of course, the exact form of the function will be different here). Therefore, setting f = 0 gives us the separatrix distinguishing between the region where resetting helps (f < 0) and where it hinders (f > 0). Utilizing this fact, we generate a phase diagram by plotting λc as a function of L, the distance between the reflecting barrier and the origin, and present the same in the inset of Fig. 12. The semi-infinite limit is obtained by taking L, where λc saturates to the corresponding value calculated/presented in the main text. For example, we see from Fig. 12 that when pr = 0.5, λc saturates to 0.78, the critical value of λ for pr = 0.5 (marked in Fig. 5 by the vertical yellow line).

In the absence of resetting, the backward master equations in terms of the survival probability read
Q0r=0(t|x0)t=λQ0r=0(t|x0)x0+D2Q0r=0(t|x0)x02+αQ1r=0(t|x0)Q0r=0(t|x0),Q1r=0(t|x0)t=λQ1r=0(t|x0)x0+D2Q1r=0(t|x0)x02+βQ0r=0(t|x0)Q1r=0(t|x0).
(C1)
Solving Eq. (C1), we obtain the following expressions for the survival functions in the Laplace space:
Q0̃r=0(s|x0)=1s1sαn2βn1+αn2en1x0n1en2x0n2,Q1̃r=0(s|x0)=1s1sαn2βn1+αn2en1x0+βn1en2x0αn2,
(C2)
where n1=λ+4Ds+λ22D and n2=λ+4D(α+β+s)+λ22D. Setting s → 0, the underlying MFPTs can be computed as before. Eventually, one finds
T0r=0=x0λ+2Dβ+αex04D(α+β)+λ2λ2Dαλλ+4D(α+β)+λ2,
(C3)
T1r=0=x0λ+2βDex04D(α+β)+λ2λ2D+1αλλ+4D(α+β)+λ2.
(C4)
The averaged MFPT is then given by
TG=prT1r=0+(1pr)T0r=0=x0λ+2βDαλ4D(α+β)+λ2λ.
(C5)
Note that for pr → 1 (β → 0), Eq. (C5) reduces to ⟨T⟩ = x0/λ, as expected. Moreover, since D, α, β > 0, the second term of the expression of ⟨TG⟩ in Eq. (C5) is always positive, which clearly shows ⟨TG⟩ > ⟨T⟩.
In this Appendix, we sketch out the basic steps used for the numerical simulations in the main text. We recall that the particle starts from and resets to x0 at a rate r. In between reset events, it diffuses in the presence of a drift λ. The evolution of this particle on a microscopic time scale Δt can be written in the form of Langevin dynamics, such as
x(t+Δt)=x0w.p. rΔt,x(t)λΔt+2DΔtη(t)w.p.(1rΔt),
(D1)
where η(t) is a δ-correlated white noise, i.e., a Gaussian random variable with a zero mean and unit variance. Note that the abbreviation w.p. in Eq. (D1) has full-form with probability. We evolve the particle at each time step Δt in our simulation according to Eq. (D1) until the particle reaches the target at x = 0. However, to implement the gating condition on the target, we define a state variable σ = (0, 1) representing the non-reactive and reactive states of the target, respectively. If the target is initially in the non-reactive state, it switches to the reactive state with probability αΔt. Similarly, it is switched from the active state to the inactive one with probability βΔt.
To compute the first passage time, we simultaneously track two events: (i) the instant when the particle crosses the origin to the negative side, i.e., x ≤ 0, and (ii) note whether the target is in an active state, i.e., σ = 1. If both conditions are satisfied, the particle gets absorbed, and the process ends. We measure the corresponding time and put it into the first passage statistics. However, if x ≤ 0 and σ = 0, then the particle gets reflected from the boundary, and the process continues until the next absorption occurs. The reflecting boundary condition is implemented by simply reversing the position of the particle, i.e., x → −x. The initial target state σ is chosen from the steady state, i.e.,
σ(t=0)=1with probabilitypr,0with probability(1pr),
(D2)
where pr = α/(α + β). In our simulations, Δt = 10−5, and the averaging was performed for 105 successful trajectories for each value of λ. The results are displayed in Fig. 3 with the star symbols, which show excellent agreement with the analytical results presented by the solid lines of the same color.
1.
C.
Maffeo
,
S.
Bhattacharya
,
J.
Yoo
,
D.
Wells
, and
A.
Aksimentiev
, “
Modeling and simulation of ion channels
,”
Chem. Rev.
112
,
6250
6284
(
2012
).
2.
P. C.
Bressloff
,
Stochastic Processes in Cell Biology
(
Springer
,
Berlin
,
2014
), Vol.
41
, pp.
10
1007
.
3.
P. C.
Bressloff
, “
Diffusion in cells with stochastically gated gap junctions
,”
SIAM J. Appl. Math.
76
(
4
),
1658
1682
(
2016
).
4.
A.
Szabo
,
D.
Shoup
,
S. H.
Northrup
, and
J. A.
McCammon
, “
Stochastically gated diffusion-influenced reactions
,”
J. Chem. Phys.
77
(
9
),
4484
4493
(
1982
).
5.
S. H.
Northrup
,
F.
Zarrin
, and
J. A.
McCammon
, “
Rate theory for gated diffusion-influenced ligand binding to proteins
,”
J. Phys. Chem.
86
(
13
),
2314
2321
(
1982
).
6.
H. X.
Zhou
and
A.
Szabo
, “
Theory and simulation of stochastically-gated diffusion-influenced reactions
,”
J. Phys. Chem.
100
(
7
),
2597
2604
(
1996
).
7.
Y. A.
Makhnovskii
,
A. M.
Berezhkovskii
,
S. Y.
Sheu
,
D. Y.
Yang
,
J.
Kuo
, and
S. H.
Lin
, “
Stochastic gating influence on the kinetics of diffusion-limited reactions
,”
J. Chem. Phys.
108
(
3
),
971
983
(
1998
).
8.
J.
Shin
and
A. B.
Kolomeisky
, “
Molecular search with conformational change: One-dimensional discrete-state stochastic model
,”
J. Chem. Phys.
149
(
17
),
174104
(
2018
).
9.
A.
Godec
and
R.
Metzler
, “
First passage time statistics for two-channel diffusion
,”
J. Phys. A: Math. Theor.
50
(
8
),
084001
(
2017
).
10.
J. L.
Spouge
,
A.
Szabo
, and
G. H.
Weiss
, “
Single-particle survival in gated trapping
,”
Phys. Rev. E
54
(
3
),
2248
(
1996
).
11.
I. V.
Gopich
and
A.
Szabo
, “
Reversible stochastically gated diffusion-influenced reactions
,”
J. Phys. Chem. B
120
(
33
),
8080
8089
(
2016
).
12.
A. M.
Berezhkovskii
,
D. Y.
Yang
,
S. H.
Lin
,
Y. A.
Makhnovskii
, and
S. Y.
Sheu
, “
Smoluchowski-type theory of stochastically gated diffusion-influenced reactions
,”
J. Chem. Phys.
106
(
17
),
6985
6998
(
1997
).
13.
J. A.
McCammon
and
S. H.
Northrup
, “
Gated binding of ligands to proteins
,”
Nature
293
(
5830
),
316
317
(
1981
).
14.
D. D.
Boehr
,
R.
Nussinov
, and
P. E.
Wright
, “
The role of dynamic conformational ensembles in biomolecular recognition
,”
Nat. Chem. Biol.
5
(
11
),
789
796
(
2009
).
15.
J.
Reingruber
and
D.
Holcman
, “
Gated narrow escape time for molecular signaling
,”
Phys. Rev. Lett.
103
(
14
),
148102
(
2009
).
16.
A.
Szabo
,
K.
Schulten
, and
Z.
Schulten
, “
First passage time approach to diffusion controlled reactions
,”
J. Chem. Phys.
72
(
8
),
4350
4357
(
1980
).
17.
M. P.
Kochugaeva
,
A. A.
Shvets
, and
A. B.
Kolomeisky
, “
How conformational dynamics influences the protein search for targets on DNA
,”
J. Phys. A: Math. Theor.
49
(
44
),
444004
(
2016
).
18.
G.
Mercado-Vásquez
and
D.
Boyer
, “
First hitting times between a run-and-tumble particle and a stochastically gated target
,”
Phys. Rev. E
103
(
4
),
042139
(
2021
).
19.
S. D.
Lawley
and
J. P.
Keener
, “
A new derivation of Robin boundary conditions through homogenization of a stochastically switching boundary
,”
SIAM J. Appl. Dyn. Syst.
14
(
4
),
1845
1867
(
2015
).
20.
G.
Mercado-Vásquez
and
D.
Boyer
, “
First hitting times to intermittent targets
,”
Phys. Rev. Lett.
123
(
25
),
250603
(
2019
).
21.
Y.
Scher
and
S.
Reuveni
, “
Unified approach to gated reactions on networks
,”
Phys. Rev. Lett.
127
(
1
),
018301
(
2021
).
22.
Y.
Scher
and
S.
Reuveni
, “
Gated reactions in discrete time and space
,”
J. Chem. Phys.
155
(
23
),
234112
(
2021
).
23.
A.
Kumar
,
A.
Zodage
, and
M. S.
Santhanam
, “
First detection of threshold crossing events under intermittent sensing
,”
Phys. Rev. E
104
(
5
),
L052103
(
2021
).
24.
A.
Kumar
,
Y.
Scher
,
S.
Reuveni
, and
M. S.
Santhanam
, “
Inference in gated first-passage processes
,” arXiv:2210.00678 (
2022
).
25.
S.
Reuveni
,
M.
Urbakh
, and
J.
Klafter
, “
Role of substrate unbinding in Michaelis–Menten enzymatic reactions
,”
Proc. Natl. Acad. Sci. U. S. A.
111
(
12
),
4391
4396
(
2014
).
26.
A.
Pal
and
V. V.
Prasad
, “
Landau-like expansion for phase transitions in stochastic resetting
,”
Phys. Rev. Res.
1
(
3
),
032001
(
2019
).
27.
É.
Roldán
,
A.
Lisica
,
D.
Sánchez-Taltavull
, and
S. W.
Grill
, “
Stochastic resetting in backtrack recovery by RNA polymerases
,”
Phys. Rev. E
93
(
6
),
062411
(
2016
).
28.
S.
Budnar
,
K. B.
Husain
,
G. A.
Gomez
,
M.
Naghibosadat
,
A.
Varma
,
S.
Verma
,
N. A.
Hamilton
,
R. G.
Morris
, and
A. S.
Yap
, “
Anillin promotes cell contractility by cyclic resetting of RhoA residence kinetics
,”
Dev. Cell
49
(
6
),
894
906.e12
(
2019
).
29.
S. B.
Yuste
,
E.
Abad
, and
K.
Lindenberg
, “
Reaction-subdiffusion model of morphogen gradient formation
,”
Phys. Rev. E
82
(
6
),
061123
(
2010
).
30.
M. R.
Evans
and
S. N.
Majumdar
, “
Diffusion with stochastic resetting
,”
Phys. Rev. Lett.
106
(
16
),
160601
(
2011
).
31.
A.
Pal
,
A.
Kundu
, and
M. R.
Evans
, “
Diffusion under time-dependent resetting
,”
J. Phys. A: Math. Theor.
49
(
22
),
225001
(
2016
).
32.
S.
Ahmad
,
I.
Nayak
,
A.
Bansal
,
A.
Nandi
, and
D.
Das
, “
First passage of a particle in a potential under stochastic resetting: A vanishing transition of optimal resetting rate
,”
Phys. Rev. E
99
(
2
),
022130
(
2019
).
33.
R. K.
Singh
,
R.
Metzler
, and
T.
Sandev
, “
Resetting dynamics in a confining potential
,”
J. Phys. A: Math. Theor.
53
(
50
),
505003
(
2020
).
34.
A.
Pal
and
V. V.
Prasad
, “
First passage under stochastic resetting in an interval
,”
Phys. Rev. E
99
(
3
),
032123
(
2019
).
35.
S.
Ray
and
S.
Reuveni
, “
Diffusion with resetting in a logarithmic potential
,”
J. Chem. Phys.
152
(
23
),
234110
(
2020
).
36.
S.
Ray
and
S.
Reuveni
, “
Resetting transition is governed by an interplay between thermal and potential energy
,”
J. Chem. Phys.
154
(
17
),
171103
(
2021
).
37.
S.
Ray
, “
Space-dependent diffusion with stochastic resetting: A first-passage study
,”
J. Chem. Phys.
153
(
23
),
234904
(
2020
).
38.
S. Y.
Ali
,
N.
Choudhury
, and
D.
Mondal
, “
Asymmetric restart in a stochastic climate model: A theoretical perspective to prevent the abnormal precipitation accumulation caused by global warming
,”
J. Phys. A: Math. Theor.
55
,
301001
(
2022
).
39.
S.
Ray
, “
Expediting Feller process with stochastic resetting
,”
Phys. Rev. E
106
(
3
),
034133
(
2022
).
40.
O. L.
Bonomo
and
A.
Pal
, “
First passage under restart for discrete space and time: Application to one-dimensional confined lattice random walks
,”
Phys. Rev. E
103
(
5
),
052129
(
2021
).
41.
P. C.
Bressloff
, “
Modeling active cellular transport as a directed search process with stochastic resetting and delays
,”
J. Phys. A: Math. Theor.
53
,
355001
(
2020
).
42.
A.
Pal
and
S.
Reuveni
, “
First passage under restart
,”
Phys. Rev. Lett.
118
(
3
),
030603
(
2017
).
43.
A.
Chechkin
and
I. M.
Sokolov
, “
Random search with resetting: A unified renewal approach
,”
Phys. Rev. Lett.
121
,
050601
(
2018
).
44.
A.
Kumar
and
A.
Pal
, “
Universal framework for record ages under restart
,”
Phys. Rev. Lett.
130
,
157101
(
2023
).
45.
M. R.
Evans
,
S. N.
Majumdar
, and
G.
Schehr
, “
Stochastic resetting and applications
,”
J. Phys. A: Math. Theor.
53
(
19
),
193001
(
2020
).
46.
O.
Tal-Friedman
,
A.
Pal
,
A.
Sekhon
,
S.
Reuveni
, and
Y.
Roichman
, “
Experimental realization of diffusion with stochastic resetting
,”
J. Phys. Chem. Lett.
11
(
17
),
7350
7355
(
2020
).
47.
B.
Besga
,
A.
Bovon
,
A.
Petrosyan
,
S. N.
Majumdar
, and
S.
Ciliberto
, “
Optimal mean first-passage time for a Brownian searcher subjected to resetting: Experimental and theoretical results
,”
Phys. Rev. Res.
2
(
3
),
032029
(
2020
).
48.
G.
Mercado-Vásquez
and
D.
Boyer
, “
Search of stochastically gated targets with diffusive particles under resetting
,”
J. Phys. A: Math. Theor.
54
(
44
),
444002
(
2021
).
49.
P. C.
Bressloff
, “
Diffusive search for a stochastically-gated target with resetting
,”
J. Phys. A: Math. Theor.
53
(
42
),
425001
(
2020
).
50.
S.
Ray
,
D.
Mondal
, and
S.
Reuveni
, “
Péclet number governs transition to acceleratory restart in drift-diffusion
,”
J. Phys. A: Math. Theor.
52
(
25
),
255002
(
2019
).
51.
A.
Pal
,
I.
Eliazar
, and
S.
Reuveni
, “
First passage under restart with branching
,”
Phys. Rev. Lett.
122
(
2
),
020602
(
2019
).
52.
I.
Golding
,
J.
Paulsson
,
S. M.
Zawilski
, and
E. C.
Cox
, “
Real-time kinetics of gene activity in individual bacteria
,”
Cell
123
(
6
),
1025
1036
(
2005
).
53.
R. P.
Gendron
and
J. E.
Staddon
, “
Searching for cryptic prey: The effect of search rate
,”
Am. Nat.
121
(
2
),
172
186
(
1983
).
54.
S.
Jain
,
D.
Boyer
,
A.
Pal
, and
L.
Dagdug
, “
Fick–Jacobs description and first passage dynamics for diffusion in a channel under stochastic resetting
,”
J. Chem. Phys.
158
(
5
),
054113
(
2023
).
55.
A.
Pal
,
R.
Chatterjee
,
S.
Reuveni
, and
A.
Kundu
, “
Local time of diffusion with stochastic resetting
,”
J. Phys. A: Math. Theor.
52
(
26
),
264002
(
2019
).
56.
A.
Pal
,
S.
Kostinski
, and
S.
Reuveni
, “
The inspection paradox in stochastic resetting
,”
J. Phys. A: Math. Theor.
55
(
2
),
021001
(
2022
).
57.
S.
Reuveni
, “
Optimal stochastic restart renders fluctuations in first passage times universal
,”
Phys. Rev. Lett.
116
(
17
),
170601
(
2016
).
58.
J. R.
Moffitt
,
Y. R.
Chemla
, and
C.
Bustamante
, “
Methods in statistical kinetics
,” in
Methods in Enzymology
(
Academic Press
,
2010
), Vol.
475
, pp.
221
257
.
59.
K.
Henzler-Wildman
and
D.
Kern
, “
Dynamic personalities of proteins
,”
Nature
450
(
7172
),
964
972
(
2007
).
60.
D. E.
Makarov
,
Single Molecule Science: Physical Principles and Models
(
CRC Press
,
2015
).
61.
N. G.
Van Kampen
,
Stochastic Processes in Physics and Chemistry
(
Elsevier
,
1992
), Vol.
1
.
62.
C. W.
Gardiner
,
Handbook of Stochastic Methods
(
Springer
,
Berlin
,
1985
), Vol.
3
, pp.
2
20
.
63.
S.
Redner
,
A Guide to First-Passage Processes
(
Cambridge University Press
,
2001
).
64.
A.
Pal
, “
Diffusion in a potential landscape with stochastic resetting
,”
Phys. Rev. E
91
(
1
),
012113
(
2015
).
65.
S.
Eule
and
J. J.
Metzger
, “
Non-equilibrium steady states of stochastic processes with intermittent resetting
,”
New J. Phys.
18
(
3
),
033006
(
2016
).
66.
D.
Gupta
,
C. A.
Plata
, and
A.
Pal
, “
Work fluctuations and Jarzynski equality in stochastic resetting
,”
Phys. Rev. Lett.
124
(
11
),
110608
(
2020
).
67.
X.
Zhuang
,
T.
Ha
,
H. D.
Kim
,
T.
Centner
,
S.
Labeit
, and
S.
Chu
, “
Fluorescence quenching: A tool for single-molecule protein-folding study
,”
Proc. Natl. Acad. Sci. U. S. A.
97
(
26
),
14241
14244
(
2000
).
68.
B.
Somogyi
,
J. A.
Norman
, and
A.
Rosenberg
, “
Gated quenching of intrinsic fluorescence and phosphorescence of globular protein: An extended model
,”
Biophys. J.
50
,
55
61
(
1986
).
69.

See https://github.com/arupb1998/Rate-enhancement-of-gated-drift-diffusion-process-by-optimal-resetting, which contains the Mathematica notebook with all the detailed calculations for the confined geometry.

Published open access through an agreement with The University of Edinburgh School of Physics and Astronomy