← Latest papers
🔬 condensed matter

Persistence, resetting, and first-passage times of an active Ornstein--Uhlenbeck particle

This paper analytically investigates how stochastic resetting and active persistence jointly influence the first-passage time statistics of an active Ornstein--Uhlenbeck particle on a finite interval, deriving conditions under which these mechanisms synergistically reduce the mean first-passage time compared to passive diffusion.

Original authors: Demosthenes K. Georgiou, Paul C. Bressloff, Thibault Bertrand

Published 2026-09-21
📖 5 min read🧠 Deep dive

Original authors: Demosthenes K. Georgiou, Paul C. Bressloff, Thibault Bertrand

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the natural world, finding a target is often a matter of time and chance. Whether it is a bacterium hunting for nutrients, a protein folding into its functional shape, or an animal searching for food, the process is fundamentally about how long it takes a wandering entity to reach a specific destination for the first time. Scientists call this the first-passage time. For simple particles moving randomly, like dust motes in a sunbeam, this journey is governed by diffusion, a slow, jittery drift. However, many living systems are not passive; they consume energy to move with purpose. These are active particles, such as swimming bacteria or synthetic micro-robots, which propel themselves forward with a degree of persistence, maintaining their direction for a short while before tumbling or changing course. Understanding how this self-driven motion affects search times is crucial, but the picture becomes even more complex when we introduce the concept of resetting. Resetting is a mechanism where a system is randomly interrupted and returned to a starting point, a strategy that can sometimes turn a hopeless, endless search into a successful one. The question remains: how does the combination of self-propelled motion and these random restarts alter the time it takes to find a target?

A team of researchers at Imperial College London has tackled this question by studying a mathematical model of an active particle confined to a narrow, one-dimensional corridor. Imagine a tiny swimmer trapped between two walls, with one wall acting as a trap that ends the journey and the other acting as a mirror that bounces the swimmer back. This swimmer is an active Ornstein–Uhlenbeck particle, a theoretical construct that moves with a velocity that fluctuates randomly but tends to stay correlated over a short period, mimicking the persistence of real biological swimmers. The researchers wanted to know how long it takes this swimmer to hit the absorbing wall, and how that time changes if the swimmer is occasionally snatched back to its starting position and given a fresh, random push. They focused on a regime of weak activity, where the self-propulsion is present but not overwhelmingly strong, allowing them to use a step-by-step mathematical approach to solve the complex equations governing the particle's motion.

The study revealed that the effect of the particle's own activity on its search time is not straightforward; it can either help or hinder the journey, depending entirely on the relationship between how long the particle keeps its direction and how long it takes to drift to the target. If the particle starts very close to the absorbing wall, its self-propulsion can actually slow it down. This happens because the particle might be pushed away from the target, traveling deep into the middle of the corridor before its direction changes, effectively wasting time. However, if the particle starts further away, or if its direction changes very quickly, the extra energy from self-propulsion acts like a boost, helping it reach the target faster than a passive, drifting particle would. The researchers found a specific crossover point where the benefit of activity flips to a cost, determined by the ratio of the particle's persistence length to the size of the container.

When the researchers introduced the element of resetting, they discovered that this intervention could rescue the search process, but only under specific conditions. If the particle starts too close to the target, resetting is counterproductive; it interrupts trajectories that were already on a fast track to success, effectively resetting the clock on a journey that was about to finish. In these cases, the more often the particle is reset, the longer it takes to arrive. However, if the particle starts further away, resetting becomes a powerful tool. By periodically returning the particle to the start, the system prevents it from getting lost in long, unproductive excursions into the middle of the corridor. The researchers identified a sweet spot, an optimal rate of resetting, that minimizes the total search time. This optimal rate exists only when the particle is far enough from the target that the risk of getting lost outweighs the risk of interrupting a good run.

A particularly subtle finding emerged when the researchers considered how the particle's velocity is handled during a reset. In their model, a reset does not just return the particle to its starting position; it also reassigns a new propulsion velocity. The researchers found that the outcome of this process depends heavily on the direction of that new velocity. If the particle is consistently reset with a velocity pointing toward the target, the search becomes significantly more efficient, and resetting remains beneficial even for particles starting quite far away. Conversely, if the reset velocity points away from the target, the benefits of resetting are diminished, and the range of starting positions where resetting helps shrinks. This highlights that the mechanics of the reset itself—what state the system is returned to—are just as important as the frequency of the reset.

Finally, the team constructed a comprehensive map of the conditions under which an active, resetting particle outperforms a simple, passive one. They found that the competition between three distinct timescales dictates the outcome: the time it takes to diffuse to the target, the time the particle maintains its direction, and the average time between resets. When the particle's persistence is short, or when the resetting is frequent enough to keep the particle from wandering too far, the active system with resetting can find the target faster than a passive system ever could. However, if the particle is too persistent and the resetting is too infrequent, the active particle gets stuck in its own momentum, and the passive, drifting particle wins the race. The study concludes that there is no single rule for the best search strategy; instead, the most efficient approach depends on a delicate balance between how long the searcher holds its course, how far it must travel, and how often it is forced to start over.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →