Work Fluctuations and Jarzynski Equality in Stochastic Resetting

Optimal conditions for first passage of jump processes with resetting

We investigate the first passage time beyond a barrier located at b≥0 of a random walk with independent and identically distributed jumps, starting from x0=0. The walk is subject to stochastic resetting, meaning that after each step the evolution is restarted with fixed probability r. We consider a resetting protocol that is an intermediate situation between a random walk (r=0) and an uncorrelated sequence of jumps all starting from the origin (r=1) and derive a general condition for determining when restarting the process with 0 Collapse

Key Words Collapse

MESH Headings Collapse

Grants Collapse

Affiliation(s)

Mattia Radice Max Planck Institute for the Physics of Complex Systems, 01187 Dresden, Germany
Giampaolo Cristadoro Dipartimento di Matematica e Applicazioni, Università degli Studi Milano-Bicocca, 20126 Milan, Italy
Samudrajit Thapa Max Planck Institute for the Physics of Complex Systems, 01187 Dresden, Germany

Collapse

Dynamics of a single anisotropic particle under various resetting protocols

We study analytically the dynamics of an anisotropic particle subjected to different stochastic resetting schemes in two dimensions. The Brownian motion of shape-asymmetric particles in two dimensions results in anisotropic diffusion at short times, while the late-time transport is isotropic due to rotational diffusion. We show that the presence of orientational resetting promotes the anisotropy to late times. When the spatial and orientational degrees of freedom are reset, we find that a non-trivial spatial probability distribution emerges in the steady state that is determined by the initial orientation, particle asymmetry and the resetting rate. When only spatial degrees of freedom are reset while the orientational degree of freedom is allowed to evolve freely, the steady state is independent of the particle asymmetry. When only particle orientation is reset, the late-time probability density is given by a Gaussian with an effective diffusion tensor, including off-diagonal terms, determined by the resetting rate. Generally, the coupling between the translational and rotational degrees of freedom, when combined with stochastic resetting, gives rise to unique behavior at late times not present in the case of symmetric particles. Considering recent developments in experimental implementations of resetting, our results can be useful for the control of asymmetric colloids, for example in self-assembly processes.

Restart uncertainty relation for monitored quantum dynamics

We introduce a time-energy uncertainty relation within the context of restarts in monitored quantum dynamics. Previous studies have established that the mean recurrence time, which represents the time taken to return to the initial state, is quantized as an integer multiple of the sampling time, displaying pointwise discontinuous transitions at resonances. Our findings demonstrate that the natural utilization of the restart mechanism in laboratory experiments, driven by finite data collection time spans, leads to a broadening effect on the transitions of the mean recurrence time. Our proposed uncertainty relation captures the underlying essence of these phenomena, by connecting the broadening of the mean hitting time near resonances, to the intrinsic energies of the quantum system and to the fluctuations of recurrence time. Our uncertainty relation has also been validated through remote experiments conducted on an International Business Machines Corporation (IBM) quantum computer. This work not only contributes to our understanding of fundamental aspects related to quantum measurements and dynamics, but also offers practical insights for the design of efficient quantum algorithms with mid-circuit measurements.

Drift-diffusive resetting search process with stochastic returns: Speedup beyond optimal instantaneous return

Stochastic resetting has recently emerged as a proficient strategy to reduce the completion time for a broad class of first-passage processes. In the canonical setup, one intermittently resets a given system to its initial configuration only to start afresh and continue evolving in time until the target goal is met. This is, however, an instantaneous process and thus less feasible for any practical purposes. A crucial generalization in this regard is to consider a finite-time return process which has significant ramifications to the firstpassage properties. Intriguingly, it has recently been shown that for diffusive search processes, returning in finite but stochastic time can gain significant speedup over the instantaneous resetting process. Unlike diffusion which has a diverging mean completion time, in this paper, we ask whether this phenomena can also be observed for a first-passage process with finite mean completion time. To this end, we explore the setup of a classical drift-diffusive search process in one dimension with stochastic resetting and further assume that the return phase is modulated by a potential U(x)=λ|x| with λ>0. For this process, we compute the mean first-passage time exactly and underpin its characteristics with respect to the resetting rate and potential strength. We find a unified phase space that allows us to explore and identify the system parameter regions where stochastic return supersedes over both the underlying process and the process under instantaneous resetting. Furthermore and quite interestingly, we find that for a range of parameters the mean completion time under stochastic return protocol can be reduced further than the optimally restarted instantaneous processes. We thus believe that resetting with stochastic returns can serve as a better optimization strategy owing to its dominance over classical first passage under resetting.

Search with stochastic home returns can expedite classical first passage under resetting

Classical first passage under resetting is a paradigm in the search process. Despite its multitude of applications across interdisciplinary sciences, experimental realizations of such resetting processes posit practical challenges in calibrating these zero time irreversible transitions. Here, we consider a strategy in which resetting is performed using finite-time return protocols in lieu of instantaneous returns. These controls could also be accompanied with random fluctuations or errors allowing target detection even during the return phase. To better understand the phenomena, we develop a unified renewal approach that can encapsulate arbitrary search processes centered around home in a fairly general topography containing targets, various resetting times, and return mechanisms in arbitrary dimensions. While such finite-time protocols would apparently seem to prolong the overall search time in comparison to the instantaneous resetting process, we show on the contrary that a significant speed-up can be gained by leveraging the stochasticity in home returns. The formalism is then explored to reveal a universal criterion distilling the benefits of this strategy. We demonstrate how this general principle can be utilized to improve overall performance of a one-dimensional diffusive search process reinforced with experimentally feasible parameters. We believe that such strategies designed with inherent randomness can be made optimal with precise controllability in complex search processes.

Continuous gated first-passage processes

Gated first-passage processes, where completion depends on both hitting a target and satisfying additional constraints, are prevalent across various fields. Despite their significance, analytical solutions to basic problems remain unknown, e.g. the detection time of a diffusing particle by a gated interval, disk, or sphere. In this paper, we elucidate the challenges posed by continuous gated first-passage processes and present a renewal framework to overcome them. This framework offers a unified approach for a wide range of problems, including those with single-point, half-line, and interval targets. The latter have so far evaded exact solutions. Our analysis reveals that solutions to gated problems can be obtained directly from the ungated dynamics. This, in turn, reveals universal properties and asymptotic behaviors, shedding light on cryptic intermediate-time regimes and refining the notion of high-crypticity for continuous-space gated processes. Moreover, we extend our formalism to higher dimensions, showcasing its versatility and applicability. Overall, this work provides valuable insights into the dynamics of continuous gated first-passage processes and offers analytical tools for studying them across diverse domains.

Stochastic dynamics of a non-Markovian random walk in the presence of resetting

The discrete stochastic dynamics of a random walker in the presence of resetting and memory is analyzed. Resetting and memory effects may compete in certain parameter regimes, and lead to significant changes in the long-time dynamics of the walker. Analytic exact results are obtained for a model memory where the walker remembers all the past events equally. In most cases, resetting effects dominate at long times and dictate the asymptotic dynamics. We discuss the full phase diagram of the asymptotic dynamics and the resulting changes due to the resetting and the memory effects.

Dynamic redundancy as a mechanism to optimize collective random searches

We explore the case of a group of random walkers looking for a target randomly located in space, such that the number of walkers is not constant but new ones can join the search, or those that are active can abandon it, with constant rates r_{b} and r_{d}, respectively. Exact analytical solutions are provided both for the fastest-first-passage time and for the collective time cost required to reach the target, for the exemplifying case of Brownian walkers with r_{d}=0. We prove that even for such a simple situation there exists an optimal rate r_{b} at which walkers should join the search to minimize the collective search costs. We discuss how these results open a new line to understand the optimal regulation in searches conducted through multiparticle random walks, e.g., in chemical or biological processes.

Efficiency of a microscopic heat engine subjected to stochastic resetting

We explore the thermodynamics of stochastic heat engines in the presence of stochastic resetting. The setup comprises an engine whose working substance is a Brownian particle undergoing overdamped Langevin dynamics in a harmonic potential with a time-dependent stiffness, with the dynamics interrupted at random times with a resetting to a fixed location. The effect of resetting to the potential minimum is shown to enhance the efficiency of the engine, while the output work is shown to have a nonmonotonic dependence on the rate of resetting. The resetting events are found to drive the system out of the linear response regime, even for small differences in the bath temperatures. Shifting the reset point from the potential minimum is observed to reduce the engine efficiency. The experimental setup for the realization of such an engine is briefly discussed.

Semi-Markov processes in open quantum systems. II. Counting statistics with resetting

A semi-Markov process method for obtaining general counting statistics for open quantum systems is extended to the scenario of resetting. The simultaneous presence of random resets and wave function collapses means that the quantum jump trajectories are no longer semi-Markov. However, focusing on trajectories and using simple probability formulas, general counting statistics can still be constructed from reset-free statistics. An exact tilted matrix equation is also obtained. The inputs of these methods are the survival distributions and waiting-time density distributions instead of quantum operators. In addition, a continuous-time cloning algorithm is introduced to simulate the large-deviation properties of open quantum systems. Several quantum optics systems are used to demonstrate these results.

Extremal statistics for a resetting Brownian motion before its first-passage time

We study the extreme value statistics of a one-dimensional resetting Brownian motion (RBM) till its first passage through the origin starting from the position x_{0} (>0). By deriving the exit probability of RBM in an interval [0,M] from the origin, we obtain the distribution P_{r}(M|x_{0}) of the maximum displacement M and thus gives the expected value 〈M〉 of M as functions of the resetting rate r and x_{0}. We find that 〈M〉 decreases monotonically as r increases, and tends to 2x_{0} as r→∞. In the opposite limit, 〈M〉 diverges logarithmically as r→0. Moreover, we derive the propagator of RBM in the Laplace domain in the presence of both absorbing ends, and then leads to the joint distribution P_{r}(M,t_{m}|x_{0}) of M and the time t_{m} at which this maximum is achieved in the Laplace domain by using a path decomposition technique, from which the expected value 〈t_{m}〉 of t_{m} is obtained explicitly. Interestingly, 〈t_{m}〉 shows a nonmonotonic dependence on r, and attains its minimum at an optimal r^{*}≈2.71691D/x_{0}^{2}, where D is the diffusion coefficient. Finally, we perform extensive simulations to validate our theoretical results.

Steady-state moments under resetting to a distribution

The nonequilibrium steady state emerging from stochastic resetting to a distribution is studied. We show that for a range of processes, the steady-state moments can be expressed as a linear combination of the moments of the distribution of resetting positions. The coefficients of this series are universal in the sense that they do not depend on the resetting distribution, only the underlying dynamics. We consider the case of a Brownian particle and a run-and-tumble particle confined in a harmonic potential, where we derive explicit closed-form expressions for all moments for any resetting distribution. Numerical simulations are used to verify the results, showing excellent agreement.

Thermodynamic trade-off relation for first passage time in resetting processes

Resetting is a strategy for boosting the speed of a target-searching process. Since its introduction over a decade ago, most studies have been carried out under the assumption that resetting takes place instantaneously. However, due to its irreversible nature, resetting processes incur a thermodynamic cost, which becomes infinite in the case of instantaneous resetting. Here, we take into consideration both the cost and the first passage time (FPT) required for a resetting process, in which the reset or return to the initial location is implemented using a trapping potential over a finite but random time period. An iterative generating function and a counting functional method à la Feynman and Kac are employed to calculate the FPT and the average work for this process. From these results, we obtain an explicit form of the time-cost trade-off relation, which provides the lower bound of the mean FPT for a given work input when the trapping potential is linear. This trade-off relation clearly shows that instantaneous resetting is achievable only when an infinite amount of work is provided. More surprisingly, the trade-off relation derived from the linear potential seems to be valid for a wide range of trapping potentials. In addition, we have also shown that the fixed-time or sharp resetting can further enhance the trade-off relation compared to that of the stochastic resetting.

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.

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.

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.

Anomalous transport tuned through stochastic resetting in the rugged energy landscape of a chaotic system with roughness

Stochastic resetting causes kinetic phase transitions, whereas its underlying physical mechanism remains to be elucidated. We here investigate the anomalous transport of a particle moving in a chaotic system with a stochastic resetting and a rough potential and focus on how the stochastic resetting, roughness, and nonequilibrium noise affect the transports of the particle. We uncover the physical mechanism for stochastic resetting resulting in the anomalous transport in a nonlinear chaotic system: The particle is reset to a new basin of attraction which may be different from the initial basin of attraction from the view of dynamics. From the view of the energy landscape, the particle is reset to a new energy state of the energy landscape which may be different from the initial energy state. This resetting can lead to a kinetic phase transition between no transport and a finite net transport or between negative mobility and positive mobility. The roughness and noise also lead to the transition. Based on the mechanism, the transport of the particle can be tuned by these parameters. For example, the combination of the stochastic resetting, roughness, and noise can enhance the transport and tune negative mobility, the enhanced stability of the system, and the resonant-like activity. We analyze these results through variances (e.g., mean-squared velocity, etc.) and correlation functions (i.e., velocity autocorrelation function, position-velocity correlation function, etc.). Our results can be extensively applied in the biology, physics, and chemistry, even social system.

Verification of Information Thermodynamics in a Trapped Ion System

Information thermodynamics has developed rapidly over past years, and the trapped ions, as a controllable quantum system, have demonstrated feasibility to experimentally verify the theoretical predictions in the information thermodynamics. Here, we address some representative theories of information thermodynamics, such as the quantum Landauer principle, information equality based on the two-point measurement, information-theoretical bound of irreversibility, and speed limit restrained by the entropy production of system, and review their experimental demonstration in the trapped ion system. In these schemes, the typical physical processes, such as the entropy flow, energy transfer, and information flow, build the connection between thermodynamic processes and information variation. We then elucidate the concrete quantum control strategies to simulate these processes by using quantum operators and the decay paths in the trapped-ion system. Based on them, some significantly dynamical processes in the trapped ion system to realize the newly proposed information-thermodynamic models is reviewed. Although only some latest experimental results of information thermodynamics with a single trapped-ion quantum system are reviewed here, we expect to find more exploration in the future with more ions involved in the experimental systems.

Reaction-path statistical mechanics of enzymatic kinetics

We introduce a reaction-path statistical mechanics formalism based on the principle of large deviations to quantify the kinetics of single-molecule enzymatic reaction processes under the Michaelis-Menten mechanism, which exemplifies an out-of-equilibrium process in the living system. Our theoretical approach begins with the principle of equal a priori probabilities and defines the reaction path entropy to construct a new nonequilibrium ensemble as a collection of possible chemical reaction paths. As a result, we evaluate a variety of path-based partition functions and free energies by using the formalism of statistical mechanics. They allow us to calculate the timescales of a given enzymatic reaction, even in the absence of an explicit boundary condition that is necessary for the equilibrium ensemble. We also consider the large deviation theory under a closed-boundary condition of the fixed observation time to quantify the enzyme-substrate unbinding rates. The result demonstrates the presence of a phase-separation-like, bimodal behavior in unbinding events at a finite timescale, and the behavior vanishes as its rate function converges to a single phase in the long-time limit.

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.

Experimental Verification of Dissipation-Time Uncertainty Relation

Dissipation is vital to any cyclic process in realistic systems. Recent research focus on nonequilibrium processes in stochastic systems has revealed a fundamental trade-off, called dissipation-time uncertainty relation, that entropy production rate associated with dissipation bounds the evolution pace of physical processes [Phys. Rev. Lett. 125, 120604 (2020)PRLTAO0031-900710.1103/PhysRevLett.125.120604]. Following the dissipative two-level model exemplified in the same Letter, we experimentally verify this fundamental trade-off in a single trapped ultracold ^{40}Ca^{+} ion using elaborately designed dissipative channels, along with a postprocessing method developed in the data analysis, to build the effective nonequilibrium stochastic evolutions for the energy transfer between two heat baths mediated by a qubit. Since the dissipation-time uncertainty relation imposes a constraint on the quantum speed regarding entropy flux, our observation provides the first experimental evidence confirming such a speed restriction from thermodynamics on quantum operations due to dissipation, which helps us further understand the role of thermodynamical characteristics played in quantum information processing.

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.

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.

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.

Finite-time fluctuation theorem for oscillatory lattices driven by a temperature gradient

The finite-time fluctuation theorem (FT) for the master functional, total entropy production, and medium entropy is studied in the one-dimensional Fermi-Pasta-Ulam-Tsingou-β (FPUT-β) chain coupled with two heat reservoirs at different temperatures. Through numerical simulations and theoretical analysis, we find that the nonequilibrium steady-state distribution of the one-dimensional FPUT-β chain violates the time-reversal symmetry. Thus, unlike the master functional, the total entropy production fails to satisfy the fluctuation relation for finite time. Meanwhile, we discuss the range of medium entropy production which obeys the conventional steady-state fluctuation theorem (SSFT) in the infinite time limit. Furthermore, we find that the generalized SSFT for medium entropy monotonically approaches the conventional SSFT as the time interval increases, irrespective of temperature difference, anharmonicity, and system size. Interestingly, the medium entropy production rate shows a nonmonotonic variation with anharomonicity, which comes from a competition mechanism of the phonon transport. Correspondingly, the difference between the generalized SSFT and the conventional SSFT shows similar nonmonotonic behaviors.

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.

Stochastic resetting of active Brownian particles with Lorentz force

Equilibrium properties of a system of passive diffusing particles in an external magnetic field are unaffected by Lorentz force. In contrast, active Brownian particles exhibit steady-state phenomena that depend on both the strength and the polarity of the applied magnetic field. The intriguing effects of the Lorentz force, however, can only be observed when out-of-equilibrium density gradients are maintained in the system. To this end, we use the method of stochastic resetting on active Brownian particles in two dimensions by resetting them to the line x = 0 at a constant rate and periodicity in the y direction. Under stochastic resetting, an active system settles into a nontrivial stationary state which is characterized by an inhomogeneous density distribution, polarization and bulk fluxes perpendicular to the density gradients. We show that whereas for a uniform magnetic field the properties of the stationary state of the active system can be obtained from its passive counterpart, novel features emerge in the case of an inhomogeneous magnetic field which have no counterpart in passive systems. In particular, there exists an activity-dependent threshold rate such that for smaller resetting rates, the density distribution of active particles becomes non-monotonic. We also study the mean first-passage time to the x axis and find a surprising result: it takes an active particle more time to reach the target from any given point for the case when the magnetic field increases away from the axis. The theoretical predictions are validated using Brownian dynamics simulations.

Tighter thermodynamic bound on the speed limit in systems with unidirectional transitions

We consider a general discrete state-space system with both unidirectional and bidirectional links. In contrast to bidirectional links, there is no reverse transition along the unidirectional links. Herein, we first compute the statistical length and the thermodynamic cost function for transitions in the probability space, highlighting contributions from total, environmental, and resetting (unidirectional) entropy production. Then we derive the thermodynamic bound on the speed limit to connect two distributions separated by a finite time, showing the effect of the presence of unidirectional transitions. Uncertainty relationships can be found for the temporal first and second moments of the average resetting entropy production. We derive simple expressions in the limit of slow unidirectional transition rates. Finally, we present a refinement of the thermodynamic bound by means of an optimization procedure. We numerically investigate these results on systems that stochastically reset with constant and periodic resetting rate.

Mitigating long transient time in deterministic systems by resetting

How long does a trajectory take to reach a stable equilibrium point in the basin of attraction of a dynamical system? This is a question of quite general interest and has stimulated a lot of activities in dynamical and stochastic systems where the metric of this estimation is often known as the transient or first passage time. In nonlinear systems, one often experiences long transients due to their underlying dynamics. We apply resetting or restart, an emerging concept in statistical physics and stochastic process, to mitigate the detrimental effects of prolonged transients in deterministic dynamical systems. We show that resetting the intrinsic dynamics intermittently to a spatial control line that passes through the equilibrium point can dramatically expedite its completion, resulting in a huge reduction in mean transient time and fluctuations around it. Moreover, our study reveals the emergence of an optimal restart time that globally minimizes the mean transient time. We corroborate the results with detailed numerical studies on two canonical setups in deterministic dynamical systems, namely, the Stuart-Landau oscillator and the Lorenz system. The key features-expedition of transient time-are found to be very generic under different resetting strategies. Our analysis opens up a door to control the mean and fluctuations in transient time by unifying the original dynamics with an external stochastic or periodic timer and poses open questions on the optimal way to harness transients in dynamical systems.

Asymmetric stochastic resetting: Modeling catastrophic events

In the classical stochastic resetting problem, a particle, moving according to some stochastic dynamics, undergoes random interruptions that bring it to a selected domain, and then the process recommences. Hitherto, the resetting mechanism has been introduced as a symmetric reset about the preferred location. However, in nature, there are several instances where a system can only reset from certain directions, e.g., catastrophic events. Motivated by this, we consider a continuous stochastic process on the positive real line. The process is interrupted at random times occurring at a constant rate, and then the former relocates to a value only if the current one exceeds a threshold; otherwise, it follows the trajectory defined by the underlying process without resetting. An approach to obtain the exact nonequilibrium steady state of such systems and the mean first passage time to reach the origin is presented. Furthermore, we obtain the explicit solutions for two different model systems. Some of the classical results found in symmetric resetting, such as the existence of an optimal resetting, are strongly modified. Finally, numerical simulations have been performed to verify the analytical findings, showing an excellent agreement.

Occupation time of a run-and-tumble particle with resetting

We study the positive occupation time of a run-and-tumble particle (RTP) subject to stochastic resetting. Under the resetting protocol, the position of the particle is reset to the origin at a random sequence of times generated by a Poisson process with rate r. The velocity state is reset to ±v with fixed probabilities ρ_{1} and ρ_{-1}=1-ρ_{1}, where v is the speed. We exploit the fact that the moment-generating functions with and without resetting are related by a renewal equation, and the latter generating function can be calculated by solving a corresponding Feynman-Kac equation. This allows us to numerically locate in Laplace space the largest real pole of the moment-generating function with resetting, and thus derive a large deviation principle (LDP) for the occupation time probability density using the Gartner-Ellis theorem. We explore how the LDP depends on the switching rate α of the velocity state, the resetting rate r, and the probability ρ_{1}. First, we show that the corresponding LDP for a Brownian particle with resetting is recovered in the fast switching limit α→∞. We then consider the case of a finite switching rate. In particular, we investigate how a directional bias in the resetting protocol (ρ_{1}≠0.5) skews the LDP rate function so that its minimum is shifted away from the expected fractional occupation time of one-half. The degree of shift increases with r and decreases with α.

Experimental Realization of Diffusion with Stochastic Resetting

Stochastic resetting is prevalent in natural and man-made systems, giving rise to a long series of nonequilibrium phenomena. Diffusion with stochastic resetting serves as a paradigmatic model to study these phenomena, but the lack of a well-controlled platform by which this process can be studied experimentally has been a major impediment to research in the field. Here, we report the experimental realization of colloidal particle diffusion and resetting via holographic optical tweezers. We provide the first experimental corroboration of central theoretical results and go on to measure the energetic cost of resetting in steady-state and first-passage scenarios. In both cases, we show that this cost cannot be made arbitrarily small because of fundamental constraints on realistic resetting protocols. The methods developed herein open the door to future experimental study of resetting phenomena beyond diffusion.