Cover times with stochastic resetting
Abstract
Cover times quantify the speed of exhaustive search. In this work, we compute exactly the mean cover time associated with a one-dimensional Brownian search under exponentially distributed resetting. We also approximate the moments of cover times of a wide range of stochastic search processes in -dimensional continuous space and on an arbitrary discrete network under frequent stochastic resetting. These results hold for a large class of resetting time distributions and search processes including diffusion and Markov jump processes.
Keywords
Cite
@article{arxiv.2406.12154,
title = {Cover times with stochastic resetting},
author = {Samantha Linn and Sean D Lawley},
journal= {arXiv preprint arXiv:2406.12154},
year = {2025}
}
Comments
This article may be downloaded for personal use only. Any other use requires prior permission of the author and AIP Publishing. This article appeared in Chaos 35, 043124 (2025) and may be found at DOI 10.1063/5.0260643