Work

Cover times with stochastic resetting

Year: 2025

Type: article

Abstract: Cover times quantify the speed of exhaustive search. In this work, we approximate the moments of cover times of a wide range of stochastic search processes in d-dimensional continuous space and on an arbitrary discrete network under frequent stochastic resetting. These approximations apply to a large class of resetting time distributions and search processes including diffusion, run-and-tumble particles, and Markov jump processes. We illustrate these results in several examples; in the case of diffusive search, we show that the errors of our approximations vanish exponentially fast. Finally, we derive a criterion for when endowing a discrete state search process with minimal stochastic resetting reduces the mean cover time.

Source: Chaos An Interdisciplinary Journal of Nonlinear Science

DOI: 10.1063/5.0260643

Authors: Samantha Linn, Sean D. Lawley

Institution: University of Utah

Language: English

Topic: Diffusion and Search Dynamics

Subfield: Molecular Biology

Field: Biochemistry, Genetics and Molecular Biology

Domain: Life Sciences

Open Access status: green

Funders: National Science Foundation, National Science Foundation Graduate Research Fellowship Program

Awards: G3386665087, CAREER: How Diffusion, Dimension, Geometry, and Redundancy Affect Cellular Dynamics, G6671297155, eMB: Collaborative Research: Stochasticity in ovarian aging and biotechnologies for menopause delay, Graduate Research Fellowship Program (GRFP)