Mirror transitions in diffusion with stochastic resetting confined on a ring

arXiv:2605.08414 · cond-mat.stat-mech · Submitted 2026-05-08 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Condensed Matter. The day in condensed matter: materials, phases and the measurements under them.

Kai: We're looking at the paper: "Mirror transitions in diffusion with stochastic resetting confined on a ring".

Mira: Here's the gist of the paper. Diffusion with an incorporated resetting mechanism provides a reference framework for modeling a wide range of natural phenomena Within this framework, the optimal resetting rate is a key quantity that arises from the optimization of the mean first-passage time In this work, we consider a particle diffusing along a circular circumference and under resetting, with an absorbing target site at a fixed location Depending on the arc length between one of the resetting sites and the absorbing target site, and the weight of the remaining resetting site, the optimal resetting rate can exhibit abrupt (“first order”) and continuous (“second order”) transitions Moreover, the behavior of the mean first-passage time is rich enough to allow both critical and tri-critical points to exist in the parameter space All the transitions have “mirror symmetry” around the selected target site and its corresponding diametrically opposite site.

Kai: General Theoretical Framework The general framework for studying first-passage statistics of an arbitrary process with stochastic resetting to successive positions z1, z2,..., that are i.i.d.

Mira: random variables taken from a probability density function (PDF) ρ(z) In order to accomplish this task, we use a renewal equation for the survival probability in the presence resetting The dynamics for a process with stochastic resetting with rate r is as follows The expression for Qr(x0, t) in Eq.

Kai: (1) is made up of two terms From first-passage theory we know that the MFPT (here denoted as Tr(x0)) of an arbitrary process, is related to the survival probability through

74: The optimal resetting rate r∗ satisfies r∗(x0) = arg min r≥0 Tr(x0) Optimization on a Single Site When applying the general framework to a Brownian particle on a circle of radius R with a single, fixed resetting site (considered in this section), we obtain the closed-form expression for the mean first-passage time The main result for this section is Tr(φ0) = cosh ξrπ − cosh ξrπ − φ∗ − φ0 / (r cosh ξrπ − φ∗ − φ1) This equation shows the finiteness of Tr when r → 0: T0 (φ0) = R squared / 2D π / 2 − π − φ∗ - φ0 squared The restart mechanism is beneficial for the task completion if φ1 is sufficiently close to the target site at φ∗ = 0 Optimization with Multiple Sites The analysis can be extended to a richer and more complex scenario involving multiple resetting sites, leading to the averaged mean first passage time (AMFPT) The AMFPT is given by ⟨Tr⟩ = Z 2π/0 ρ (θ) Tr(θ)dθ /

1 − r R 2π/0 ρ (θ) Q˜0 (θ, r) dθ: For two resetting sites, the AMFPT is given by ⟨Tr⟩ = 1/r

(m + 1) cosh ξrπ / (cosh ξrπ − φ∗ − φ1 + m cosh ξrπ − φ∗ − φ2) - 1: Intricate behaviors emerge for finite values of m and r Phase Diagram Analysis The results are summarized in the order parameter diagram, which exhibits continuous and discontinuous transitions for the optimal resetting rate r∗ Discontinuous transitions occur in the global minimum of the AMFPT, driven by sudden jumps in the optimal resetting rate r∗ Continuous transitions occur in the optimal resetting rate for m ≥ mtc The critical and tri-critical coordinates are computed by solving the equation system (38) The diagrams for the optimal resetting rate change dramatically as the first resetting site φ1 approaches the target site, located at φ∗ The locations of the resetting sites respective to the target, as well as their weights, therefore play a decisive role in the optimization of diffusion with stochastic resetting to a pair of sites This work demonstrates that diagrams for the optimal resetting rate change dramatically as the first resetting site φ1 approaches the target site.

Title and authors: Kai: We started by looking at the paper "Mirror transitions in diffusion with stochastic resetting confined on a ring." The title itself immediately tells you this is about how those geometric constraints, specifically being confined to a circle, influence the search dynamics when resetting is involved.

Mira: And it’s authored by Pedro Juli´an-Salgado, Pavel Castro-Villarreal, Leonardo Dagdug, and Denis Boyer. These authors bring together the theoretical framework with some experimental insight into how these kinds of resetting processes work in real settings.

Lev: I see the authors have a good mix here—theoretical background combined with what sounds like results derived from modeling complex systems. I'm wondering if their experimental grounding helps them see things differently than purely mathematical models might suggest.

Kai: Absolutely, Lev, that’s exactly what we look for. It grounds the math in something tangible, so when they talk about mean first passage time or those optimal rates, you know it isn't just abstract theory.

Mira: They set up this general framework using a renewal equation for the survival probability of the particle under resetting, which is a standard way to handle these kinds of intermittent search processes thirty-four fifty-five fifty-six <ref:2605.08414#pg3,a renewal equation for the survival probability>.

Lev: That renewal equation approach sounds like it’s computationally heavy if you have to solve it for every possible configuration of resetting sites we might consider.

Kai: They do show how this framework allows them to calculate the mean first passage time by taking a Laplace transform of that survival probability, which is a clever way to get around some of those direct time calculations.

Mira: The core finding they highlight is that the optimal resetting rate, denoted as r star, isn't just one fixed number; it’s actually dependent on the specific arrangement and weighting of the resetting sites.

Lev: So we're back to that idea—the optimization depends on more than just a simple parameter like the distance between points; it depends on their relative weights too.

Kai: Right, and that dependence leads directly into what they call mirror symmetry around the target site, which is a huge structural feature of their results.

Mira: That symmetry is what allows them to simplify the analysis in some parts of the study, even when you're dealing with multiple resetting sites on a ring.

Lev: Simplifying things by exploiting symmetry is always nice, but I wonder if that simplification hides some physics that only appears when you break that symmetry.

Kai: It seems like it helps them identify the critical points where things change abruptly, which is what we're interested in for understanding system transitions.

The paper's summary: Mira: So, to summarize the main point of "Mirror transitions in diffusion with stochastic resetting confined on a ring," the paper investigates how the optimal way to reset a diffusing particle changes when there are multiple resetting sites available on that circular track.

Kai: Essentially, they look at how having two or more random spots to reset versus just one spot influences the mean first passage time, and they find that this influence can cause the optimal resetting rate to undergo both abrupt first-order transitions and continuous second-order transitions.

Lev: So it’s not just a smooth change; there are sharp jumps in the optimal rate depending on how you move those sites around the circle or change their weights.

Mira: That's right, and they go further by showing that this rich behavior allows for both critical and tri-critical points to exist within the parameter space of those resetting site parameters.

Kai: That means you can find sweet spots where the search efficiency is at a minimum, and these minima can be found in ways that are not just smooth shifts but involve sudden jumps.

Lev: From an engineering standpoint, that's significant because it tells us we need to look for those non-smooth behaviors when designing systems for fast relocation.

Mira: The authors show this is happening in the averaged mean first passage time calculation as well, which involves averaging over all possible starting positions and resetting distributions.

Kai: It’s a comprehensive view because they aren't just looking at one specific case; they are looking at the general framework for how these things play out across different configurations.

Lev: I just hope that when we look at the actual numbers, we can find a way to connect this theoretical structure to something measurable in our hardware.

Mira: They do provide analytical expressions for certain limiting regimes, like when the resetting rate is very small or very large, which gives us some simpler versions of the AMFPT equation.

Kai: So it’s not just about getting one answer; it’s about understanding the whole landscape of possibilities created by these multiple resetting mechanisms.

The paper's improvements: Lev: I'm interested in what they suggest as improvements, because usually papers point out limitations, and I want to know what they think is missing for the next version of this work.

Mira: They discuss how allowing multiple resetting locations modifies first passage optimization in a non-trivial way, which is a big conceptual step beyond just studying single resets.

Kai: That’s the main improvement, moving from single sites to multiple sites and showing that it introduces this complexity we discussed earlier.

Lev: And they point out that the MFPT can develop two competing minima when you reset to two discrete sites, which suggests a richer landscape of performance than what we might see with one site.

Mira: They also highlight how the averaged mean first passage time calculation becomes intricate for finite values of both the number of sites and their weights, which is a limitation they acknowledge.

Kai: So it seems like they’re signaling that this complexity is real, and not something to ignore when modeling these systems with multiple resets.

Lev: And I wonder if the next step would be developing an AI system to actually find those optimal resetting rates for a particle given the parameters of the paper.

Mira: That connects nicely with your point about AI finding that optimal rate, because we can use machine learning to search through this parameter space and predict where those transitions occur.

Kai: Exactly, so the paper gives us a roadmap for how to use AI to guide those adaptive strategies based on what the system is doing in real time.

Lev: And I think if we could figure out how much overhead it lands on real hardware would be a big validation of this theoretical framework for practical use.

Conclusion: Kai: So, wrapping up the discussion on "Mirror transitions in diffusion with stochastic resetting confined on a ring," the authors have shown that for this system, you can get both first-order and second-order transitions in the optimal resetting rate based on site geometry.

Mira: They’ve mapped out critical and tri-critical points in the order parameter diagram, which is a big result because it shows there's more to this than just a single minimum.

Lev: It really reinforces that when you're dealing with multiple competing search strategies, you can expect these non-smooth changes based on the configuration of those sites.

Kai: The whole point is that the configuration of resetting sites relative to the target and their weights is absolutely decisive in optimizing performance here.

Mira: So this paper gives us a solid foundation for predicting when we’ll see these kinds of complex behaviors in experimental setups involving multiple resets.

Lev: We can use this to guide our design choices when we decide whether or not to use resetting at all based on those transition points.

Kai: It's a lot of information, but it paints a clear picture of how the geometry dictates the search landscape for diffusion with stochastic resetting confined on a ring.

Mira: And it’s definitely worth paying attention to when you're thinking about designing systems that need to handle intermittent dynamics in their searching agents.

Lev: It’s good stuff, and it gives us a clear direction for where our own research could go next regarding the practical implications of these kinds of complex optimization landscapes.

Pedro Julián-Salgado, Pavel Castro-Villarreal, Leonardo Dagdug, Denis Boyer

Departamento de Física, Universidad Autónoma Metropolitana Mexico City · Facultad de Ciencias en Física y Matemáticas, Universidad Autónoma de Chiapas · Instituto de Física, Universidad Nacional Autónoma de México

cond-mat.stat-mech

Submitted: 2026-05-08

Updated: 2026-05-08

Comments: 17 pages, 10 figures and 1 table

Journal ref: Phys. Rev. E 114, 044142 (2026)

DOI: 10.1103/2fsc-jkq8

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 78/100

The gist: Diffusion with an incorporated resetting mechanism provides a reference framework for modeling a wide range of natural phenomena Within this framework…

Key concepts

Optimal Resetting Rate (r*)
This is the best rate to reset a diffusing particle to minimize its average time to reach a target. The paper finds that this optimal rate can change suddenly (abruptly) or smoothly (continuously) as you adjust the positions and weights of the resetting sites.
Mean First-Passage Time (MFPT)
This is the average time it takes for a particle, undergoing diffusion, to reach a specific target site. The paper uses this metric to determine which resetting strategy is most effective in speeding up this search process.
Phase Diagram Analysis
This involves plotting the results of the study using an 'order parameter' diagram. This visualization shows where the optimal resetting rate transitions between different behaviors, such as when it jumps abruptly or changes smoothly, revealing critical points.
Mirror Symmetry
The results show a symmetry around a target site and its opposite point. This means that the behavior of the optimal resetting rate is related to configurations on either side of the target, simplifying the study by reducing the number of cases that need to be analyzed.

Terminology

Summary

Diffusion with an incorporated resetting mechanism provides a reference framework for modeling a wide range of natural phenomena Within this framework, the optimal resetting rate is a key quantity that arises from the optimization of the mean first-passage time In this work, we consider a particle diffusing along a circular circumference and under resetting, with an absorbing target site at a fixed location Depending on the arc length between one of the resetting sites and the absorbing target site, and the weight of the remaining resetting site, the optimal resetting rate can exhibit abrupt (“first order”) and continuous (“second order”) transitions Moreover, the behavior of the mean first-passage time is rich enough to allow both critical and tri-critical points to exist in the parameter space All the transitions have “mirror symmetry” around the selected target site and its corresponding diametrically opposite site. p. 0

Where the paper says it

Depending on the arc length between one of the resetting sites and the absorbing target site, and the weight of the remaining resetting site, the optimal resetting rate can exhibit abrupt (“first order”) and continuous (“second order”) transitions. Moreover, the behavior of the mean first-passage time is rich enough to allow both critical and tri-critical points to exist in the parameter space.

General Theoretical Framework

The general framework for studying first-passage statistics of an arbitrary process with stochastic resetting to successive positions z1, z2,..., that are i.i.d. random variables taken from a probability density function (PDF) ρ(z) In order to accomplish this task, we use a renewal equation for the survival probability in the presence resetting The dynamics for a process with stochastic resetting with rate r is as follows The expression for Qr(x0, t) in Eq. p. 2

Where the paper says it

random variables taken from a probability density function (PDF) ρ(z) [34, 55, 56]. In order to accomplish this task, we use a renewal equation for the survival probability in the presence resetting.

(1) is made up of two terms From first-passage theory we know that the MFPT (here denoted as Tr(x0)) of an arbitrary process, is related to the survival probability through [74] The optimal resetting rate r∗ satisfies r∗(x0) = arg min r≥0 Tr(x0)

Optimization on a Single Site

When applying the general framework to a Brownian particle on a circle of radius R with a single, fixed resetting site (considered in this section), we obtain the closed-form expression for the mean first-passage time The main result for this section is Tr(φ0) = cosh ξrπ − cosh ξrπ − φ∗ − φ0 / (r cosh ξrπ − φ∗ − φ1) This equation shows the finiteness of Tr when r → 0: T0 (φ0) = R squared / 2D π / 2 − π − φ∗ - φ0 squared The restart mechanism is beneficial for the task completion if φ1 is sufficiently close to the target site at φ∗ = 0

Optimization with Multiple Sites

The analysis can be extended to a richer and more complex scenario involving multiple resetting sites, leading to the averaged mean first passage time (AMFPT) The AMFPT is given by ⟨Tr⟩ = Z 2π/0 ρ (θ) Tr(θ)dθ / [1 − r R 2π/0 ρ (θ) Q˜0 (θ, r) dθ] For two resetting sites, the AMFPT is given by ⟨Tr⟩ = 1/r [(m + 1) cosh ξrπ / (cosh ξrπ − φ∗ − φ1 + m cosh ξrπ − φ∗ − φ2) - 1] Intricate behaviors emerge for finite values of m and r

Phase Diagram Analysis

The results are summarized in the order parameter diagram, which exhibits continuous and discontinuous transitions for the optimal resetting rate r∗ Discontinuous transitions occur in the global minimum of the AMFPT, driven by sudden jumps in the optimal resetting rate r∗ Continuous transitions occur in the optimal resetting rate for m ≥ mtc The critical and tri-critical coordinates are computed by solving the equation system (38)

Conclusions

The diagrams for the optimal resetting rate change dramatically as the first resetting site φ1 approaches the target site, located at φ∗ The locations of the resetting sites respective to the target, as well as their weights, therefore play a decisive role in the optimization of diffusion with stochastic resetting to a pair of sites This work demonstrates that diagrams for the optimal resetting rate change dramatically as the first resetting site φ1 approaches the target site.

Table I summarizes critical and tri-critical values found for different angular values of φ1 The AMFPT in Eq. p. 8

Where the paper says it

No critical point exists for φ1 = 3π/2, but this situation will change in the next section dedicated to other values of φ1. Based on these results, we can draw the following conclusions about the behavior of the AMFPT when φ2 ∈ U1 S U2 (see Fig.

(30) exhibits a level of complexity that allows critical and tri-critical points to exist in the order parameter diagram. p. 0
Where the paper says it

Depending on the arc length between one of the resetting sites and the absorbing target site, and the weight of the remaining resetting site, the optimal resetting rate can exhibit abrupt (“first order”) and continuous (“second order”) transitions. Moreover, the behavior of the mean first-passage time is rich enough to allow both critical and tri-critical points to exist in the parameter space.

The optimal resetting rate r∗ suffers discontinuous transitions for arbitrarily small weight m, provided that the second resetting site φ2 is sufficiently near the target. p. 9
Where the paper says it

7 are composed of all transition points occurring in the interval U1 and U2, respectively. The parameter r ∗ suffers discontinuous transitions for arbitrarily small weight m, provided that the second resetting site φ2 is sufficiently near the target.

The critical and tri-critical coordinates for the representative values of φ1 considered in this study were listed in Table I. p. 2
Where the paper says it

3 I, which summarizes the critical and tri-critical coordinates for other representative configurations between the primary resetting site and the target location. Finally, in section VII, we provide our concluding remarks.

The AMFPT admits useful analytical expressions in some limiting regimes (m → 0, m → ∞ and r → 0, respectively) and displays mirror symmetries that reduce the number of configurations to be studied. p. 5
Where the paper says it

RESULTS ON TWO-SITE RESETTING WITH φ∗ = π/2 AND φ1 = 3π/2 To characterize the optimal behavior of the AMFPT in Eq. (30), we can reduce the number of free parameters by fixing φ∗ and φ1.

The “order parameter” diagrams in Figs. p. 0
Where the paper says it

Depending on the arc length between one of the resetting sites and the absorbing target site, and the weight of the remaining resetting site, the optimal resetting rate can exhibit abrupt (“first order”) and continuous (“second order”) transitions. Moreover, the behavior of the mean first-passage time is rich enough to allow both critical and tri-critical points to exist in the parameter space.

6, 9 and 10 constitute one of the main results of this study. p. 0
Where the paper says it

Within this framework, the optimal resetting rate is a key quantity that arises from the optimization of the mean first-passage time. While substantial work has focused on the study of the optimal resetting rate in unbounded one dimensional domains, little is still known about the optimization of the mean first-passage time in bounded systems, in particular when multiple resetting sites are available.

The locations of the resetting sites respective to the target, as well as their weights, therefore play a decisive role in the optimization of diffusion with stochastic resetting to a pair of sites. p. 1
Where the paper says it

Going beyond the standard framework of resetting to a single site or state, a growing body of work has demonstrated that allowing multiple resetting locations can modify first passage optimization in a non-trivial way [54]. In one dimension, resetting to two discrete sites already produces a remarkably rich structure: the MFPT may develop two competing minima, and the optimal resetting rate can undergo discontinuous transitions as the relative position or statistical weights of the resetting sites are varied [55].

The transitions found here provide a comprehensive foundation for future analytical refinements and for exploring other resetting distributions. p. 7
Where the paper says it

In contrast, the critical point characterizes coordinates that separate discontinuous (first-order) transitions from smooth variations of r ∗ (without a transition point). Critical points were previously found in two-point resetting on the semi-infinite line [55] (and also with other distributions [56]), and are therefore expected here.

Appendix A provides the free propagator of a Brownian particle in a ring Appendix B explains how these equations are used to derive the inequality in Eq. p. 3

Where the paper says it

(10) Here, Q˜ 0(φ0, s) represents the Laplace transform of Q0(φ0, t), the probability that a free Brownian particle starting at φ0 has not yet visited the target φ∗ by time t. The Laplace transform Q˜ 0(φ0, s) can be calculated by means of the memoryless property of diffusion and using standard methods for solving partial differential equations (e.

(8) for resetting to a single point. p. 2
Where the paper says it

(6) The effect of a small resetting rate in a given system is beneficial for search if the MFPT is a decreasing function of r in the limit r → 0, or limr→0 dTr dr < 0. (7) In the case of resetting to a single point x1, where ρ(z) = δ(z − x1), for resetting to expedite the search process, the following condition must be fulfilled (see [75, 76] and also appendix B), ⟨t 2 0 (x0)⟩ − 2⟨t0(x0)⟩⟨t0(x1)⟩ > 0, (8) where the random variable t0(xi) is the first-passage time of the underlying process without resetting, starting from the position xi .

The paper's pages are labelled 1 through 17 and the text under Page N carries that same page number as its token.

--- Page 1 ---

Mirror transitions in diffusion with stochastic resetting confined on a ring Diffusion with an incorporated resetting mechanism provides a reference framework for modeling a wide range of natural phenomena Within this framework, the optimal resetting rate is a key quantity that arises from the optimization of the mean first-passage time In this work, we consider a particle diffusing along a circular circumference and under resetting, with an absorbing target site at a fixed location Depending on the arc length between one of the resetting sites and the absorbing target site, and the weight of the remaining resetting site, the optimal resetting rate can exhibit abrupt (“first order”) and continuous (“second order”) transitions Moreover, the behavior of the mean first-passage time is rich enough to allow both critical and tri-critical points to exist in the parameter space All the transitions have “mirror symmetry” around the selected target site and its corresponding diametrically opposite site.

I. INTRODUCTION

Searching agents, either microscopic or macroscopic, often engage in dynamic strategies to locate specific sites or resources essential for sustaining biological processes In most of the situations mentioned above, the search processes to be optimized take place in environments where inherent stochastic dynamics strongly influence first-passage encounters Diffusion with a resetting protocol can be classified as an intermittent search process Remarkably, this relocation action eliminates inefficient trajectories that would otherwise cause the mean first-passage time (MFPT) to diverge in unbounded domains Diffusion subject to stochastic resetting has attracted considerable attention and has been studied for many systems

II. GENERAL FRAMEWORK

In this section, we review a general framework for studying first-passage statistics of an arbitrary process with stochastic resetting to successive positions z1, z2,..., that are i.i.d. random variables taken from a probability density function (PDF) ρ(z) We define Qr(x0, t) as the probability that the particle under resetting and with initial position at x0 has not yet found a specified target region up to time t From first-passage theory we know that the MFPT (here denoted as Tr(x0)) of an arbitrary process, is related to the survival probability through [74] Taking the Laplace transform of Eq. p. 2

Where the paper says it

From first-passage theory we know the MFPT (here denoted as Tr(x0)) of an arbitrary process, is related to the survival probability through [74] Tr(x0) = Z ∞ 0 Qr(x0, t)dt. (2) Let us define the Laplace transform of Qr(x0, t) as Q˜ r (x0, s) = L{Qr(x0, t)} = R ∞ 0 e −stQr (x0, t) dt.

(1) yields Q˜r (x0, s) = Q˜0 (x0, r + s) / [1 − r R ∞ -∞ ρ(z)Q˜0 (z, r + s)] Consequently, the MFPT with an incorporated resetting mechanism can be computed using the Laplace transform of the survival probability of the underlying process without resetting

--- Page 2 ---

We can mention random walks on networks with resetting to a node [40], or experimental realizations [44–46], to name just a few Going beyond the standard framework of resetting to a single site or state, a growing body of work has demonstrated that allowing multiple resetting locations can modify first passage optimization in a non-trivial way In one dimension, resetting to two discrete sites already produces a remarkably rich structure: the MFPT may develop two competing minima, and the optimal resetting rate can undergo discontinuous transitions as the relative position or statistical weights of the resetting sites are varied

--- Page 3 ---

Diffusion with a resetting protocol can be classified as an intermittent search process In these systems, stochastic motion represents a phase during which the target may be captured, whereas a resetting event acts as a fast relocation that drives the particle back to a pre-established state Remarkably, this relocation action eliminates inefficient trajectories that would otherwise cause the mean first-passage time (MFPT) to diverge in unbounded domains Diffusion subject to stochastic resetting has attracted considerable attention and has been studied for many systems

--- Page 4 ---

In order to use the MFPT result derived in Eq. (5), we identify the analogous quantities for this specific geometry The full result for Q˜0 (φ0, s) is calculated explicitly in appendix A, and is given by Q˜0(φ0, r) = 1 / r " 1 - cosh ξrπ − φ∗ − φ0 / cosh ξrπ

--- Page 5 ---

Hence, we first expand Q˜0(φi, s) of Eq. (11) in powers of s Q˜0(φi, s) = R squared / 2D π / 2 − a squared + R 4 / 4D squared π / 2 a squared − 5π/46 - a 4/6! p. 4

Where the paper says it

5 Hence, we first expand Q˜ 0(φi , s) of Eq. (11) in powers of s Q˜ 0(φi , s) = R2 2D π 2 − a 2 + R4 4D2 π 2 a 2 − 5π 4 6 − a 4 6 !

s + O(s2) Using this expansion, along with Eq. p. 4
Where the paper says it

s + O(s 2 ) (17) where a = π−|φ∗−φi |. Using this expansion, along with Eq.

(17), it is straightforward to show that the second moment of the MFPT in Eq. p. 4
Where the paper says it

Using this expansion, along with Eq. (17), it is straightforward to show that the second moment of the MFPT in Eq.

(15), denoted as T20(φi) is D / TE = R 4 / 2D squared − π/2 φi - φ∗2 + 5π/46 + φi - φ∗ 4/6! p. 4
Where the paper says it

(17), it is straightforward to show that the second moment of the MFPT in Eq. (15), denoted as T 2 0 (φi) , is D T 2 0 (φi) E = R4 2D2 −π 2 |φi − φ∗| 2 + 5π 4 6 + |φi − φ∗| 4 6 !

--- Page 6 ---

The restart mechanism is beneficial for the task completion if φ1 is sufficiently close to the target site at φ∗ = 0

--- Page 7 ---

We now apply the general framework of the previous section to the following system with periodic boundar The full result for Q˜r(s, φ0) is calculated explicitly in appendix A, and is given by Q˜r (s, φ0) = cosh ξlπ − cosh ξlπ − φ∗ - φ0 / (s cosh ξlπ + r cosh ξlπ − φ∗ - φ1) This is the main result for this section

--- Page 8 ---

The first takeaway from this equation is the finiteness of Tr when r → 0: T0 (φ0) = R squared / 2D π / 2 − π − φ∗ - φ0 squared On the other hand, one can corroborate that in the limit r → ∞, Eq. (14) diverges

--- Page 9 ---

The restart mechanism is beneficial for the task completion if φ1 is sufficiently close to the target site at φ∗ = 0

--- Page 10 ---

In what follows, we exploit this rather simple expression to investigate the optimization behavior of ⟨Tr⟩ for only two resetting sites The AMFPT is given by Eq. (33) Intricate behaviors emerge for finite values of m and r The transition to r∗ = 0 occurs at φ2t and it is continuous

--- Page 11 ---

In the next section, we explore how this behavior of r∗ evolves when φ1 is placed even closer to the target location The diagrams for the optimal resetting rate change dramatically as the first resetting site φ1 approaches the target site

--- Page 12 ---

The lower and upper branches in Fig. 7 are composed of all transition points occurring in the interval U1 and U2, respectively The critical and tri-critical coordinates for the representative values of φ1 considered in this study were listed in Table I. p. 7

Where the paper says it

(37) We recall that we use superscripts (1) and (2) to distinguish the transition and tri-critical values of φ2 occurring in U1 and U2, respectively. Computation of the critical coordinates Now, to compute the tri-critical point, for example the one that occurs in U1, (φ (1) tc , mtc)—due to Eq.

Each value of φ1 studied yields peculiar first and second-order transitions, where the dependence of r∗ on φ2 and m requires a separate analysis. p. 0
Where the paper says it

We also calculate the mean first-passage time at the target site, and study the dependence of the optimal resetting rate in terms of the relevant parameters of the system in a two-resetting site configuration. Depending on the arc length between one of the resetting sites and the absorbing target site, and the weight of the remaining resetting site, the optimal resetting rate can exhibit abrupt (“first order”) and continuous (“second order”) transitions.

p. 0
Where the paper says it

We also calculate the mean first-passage time at the target site, and study the dependence of the optimal resetting rate in terms of the relevant parameters of the system in a two-resetting site configuration. Depending on the arc length between one of the resetting sites and the absorbing target site, and the weight of the remaining resetting site, the optimal resetting rate can exhibit abrupt (“first order”) and continuous (“second order”) transitions.

--- Page 13 ---

The AMFPT in Eq. (30) exhibits a level of complexity that allows critical and tri-critical points to exist in the order parameter diagram

--- Page 14 ---

The AMFPT admits useful analytical expressions in some limiting regimes (m → 0, m → ∞ and r → 0, respectively) and displays mirror symmetries that reduce the number of configurations to be studied The “order parameter” diagrams in Figs. 6, 9 and 10 constitute one of the main results of this study These diagrams show a rich mixture of second-order transitions, where r∗ continuously reaches zero as φ2 is varied, and discontinuous transitions, characterized by abrupt jumps between r∗ = 0 and r∗ > 0, or two non-zero values The symmetry of the AMFPT described in Eq. p. 7

Where the paper says it

This value, associated to the transition angle φ2 = φ (1) tc ≈ 0. 1481π, represents a “tri-critical” point, which separates m-values producing abrupt jumps in r ∗ (m < mtc) as φ2 is varied, from those where r ∗ decreases and reaches zero continuously at φ2t (m ≥ mtc).

(35) can now be directly appreciated in Fig. p. 9
Where the paper says it

The symmetry of the AMFPT described in Eq. (35) can now be directly appreciated in Fig.

p. 9
Where the paper says it

The symmetry of the AMFPT described in Eq. (35) can now be directly appreciated in Fig.

p. 9
Where the paper says it

The symmetry of the AMFPT described in Eq. (35) can now be directly appreciated in Fig.

6

--- Page 15 ---

The optimal resetting rate, which is 0 for φ2 φ(1)2t By symmetry, this continuous behavior also applies to U2, where r∗ decreases to zero as φ2 moves away from the target location The critical and tri-critical coordinates for the representative values of φ1 considered in this study were listed in Table I. Each value of φ1 studied yields peculiar first and second-order transitions, where the dependence of r∗ on φ2 and m requires a separate analysis.

--- Page 16 ---

The optimal resetting rate, which is 0 for all m if φ2 ≥ [1.05π, 1.95π] The continuous transitions are shown with solid lines, whereas those that are discontinuous (r∗ jumps to a finite value) are represented with dashed lines

--- Page 17 ---

The symmetry of the AMFPT described in Eq. (35) can now be directly appreciated in Fig. 6 The lower and upper branches in Fig. p. 9

Where the paper says it

7 inherits the same symmetry around π/2 observed in the r ∗ versus φ2 diagram of Fig. The lower and upper branches in Fig.

p. 9
Where the paper says it

7 inherits the same symmetry around π/2 observed in the r ∗ versus φ2 diagram of Fig. The lower and upper branches in Fig.

7 are composed of all transition points occurring in the interval U1 and U2, respectively

--- Page 18 ---

The optimal resetting rate, which is 0 for all m if φ2 ≥ [1.05π, 1.95π] The continuous transitions are shown with solid lines, whereas those that are discontinuous (r∗ jumps to a finite value) are represented with dashed lines

--- Page 19 ---

The symmetry of the AMFPT described in Eq. (35) can now be directly appreciated in Fig. 6 The lower and upper branches in Fig.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Precision search strategy optimization for molecular agents: The improved AI system can determine an optimal resetting rate r star that minimizes mean first-passage time for a particle diffusing along a circular circumference when it has access to multiple, probabilistically weighted resetting sites.

  2. Predicting phase transitions in search efficiency: The system can predict when the optimal resetting rate r star undergoes abrupt first order or continuous second order transitions based on the arc length between sites and their relative weights, allowing for the identification of critical and tri-critical points in parameter space.

  3. Modeling complex searching behaviors under multiple resets: The AI can calculate the averaged mean first passage time (AMFPT) for a particle starting randomly among resetting sites, enabling it to quantify how varying the distribution of resetting sites affects overall search performance.

  4. Adaptive search strategy selection based on environment: By analyzing the order parameter diagram r star versus phi 2, the system can select whether to use resetting at all (r star = 0) or employ a specific non-zero rate depending on the current configuration of resetting sites and target location.

  5. Target localization and site placement guidance: The system can advise on optimal placement of multiple resetting sites relative to the absorbing target site, specifically identifying configurations where resetting expedites the search process by analyzing conditions like ⟨t20(xi)⟩ - 2⟨t0(xi)⟩⟨t0(x1)⟩ > 0.

Abstract

Diffusion with an incorporated resetting mechanism provides a reference framework for modeling a wide range of natural phenomena. Within this framework, the optimal resetting rate is a key quantity that arises from the optimization of the mean first-passage time. While substantial work has focused on the study of the optimal resetting rate in unbounded one dimensional domains, little is still known about the optimization of the mean first-passage time in bounded systems, in particular when multiple resetting sites are available. In this work, we consider a particle diffusing along a circular circumference and under resetting, with an absorbing target site at a fixed location. Using the appropriate free propagator for this system, we compute the Laplace transform of the survival probability when resetting occurs to multiple sites drawn from an arbitrary probability density function. We also calculate the mean first-passage time at the target site, and study the dependence of the optimal resetting rate in terms of the relevant parameters of the system in a two-resetting site configuration. Depending on the arc length between one of the resetting sites and the absorbing target site, and the weight of the remaining resetting site, the optimal resetting rate can exhibit abrupt ("first order'') and continuous ("second order'') transitions. Moreover, the behavior of the mean first-passage time is rich enough to allow both critical and tri-critical points to exist in the parameter space. All the transitions have "mirror symmetry'' around the selected target site and its corresponding diametrically opposite site.

Related papers