Cover times with stochastic resetting

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 d-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.