Mathematical Biology Seminar Samantha Linn, University of Utah, Tuesday, Nov. 26, 2024 2:00pm in LCB 323 Can stochastic resetting accelerate a search for multiple targets? Abstract: Ubiquitous in biology are stochastic `searchers' looking for more than one `target'. In this talk we will review pre-existing results on cover times, which quantify the speed of exhaustive search. We will then consider cover times of searchers undergoing stochastic resetting, a mechanism capable of reducing mean first passage times (i.e. single target search times). Exact computation of these cover time statistics is often analytically intractable and the corresponding simulation nontrivial. By considering the frequent resetting limit, we will approximate cover time moments on arbitrary discrete networks and in d-dimensional continuous space thereby shedding light on the titular question.