Cover times with stochastic resetting

2024/06/17 by Linn, Samantha, Lawley, Sean D · 1 citation
#60G07 #60G70 #60J27 #60J60 #60J65 #FOS: Mathematics #FOS: Physical sciences #Probability (math.PR) #Statistical Mechanics (cond-mat.stat-mech)

paper · doi:10.48550/arxiv.2406.12154

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

Cited by

• Resonances of recurrence time of monitored quantum walks

Related

• First passage times under frequent stochastic resetting
• Cover times of many random walkers on a discrete network
• First-passage time of a Brownian searcher with stochastic resetting to random positions
• Stochastic resetting prevails over sharp restart for broad target distributions
• Cover times of many diffusive or subdiffusive searchers