Title: Universal behavior of stochastic search with frequent stochastic resetting
 
Abstract: Stochastic resetting - wherein the position of a searcher randomly resets - has been popularized as a means of accelerating stochastic search processes. Stochastic resetting appears naturally, as in RNA cleavage during transcription and predator dynamics during foraging, but can also be engineered into systems like computer search algorithms. In this seminar we will introduce a generalized framework for studying such systems and thereby derive the full distribution and moments of first passage times for stochastic search under frequent stochastic resetting. We will then consider the analogous cover time problem, which quantifies the speed of exhaustive search. Under a certain scaling we will see that the first passage and cover times of many stochastic search processes with stochastic resetting behave similarly.

Zoom Information:

https://unm.zoom.us/j/98912959181

Meeting ID: 989 1295 9181
Passcode: 811422