ICMCS Seminar - Stochastic Resetting and Its Associated Costs

Title: Stochastic Resetting and Its Associated Costs

Abstract: Searching for misplaced objects is a task that we are all familiar with. In particular, a common strategy for finding a misplaced object, such as keys, is to repeatedly reset to the object's last known location. It can be shown mathematically that in many cases, such resets expedite the mean time to complete the search process. However, in practice, resets must also incur costs, whether in time, energy, or money. 

In this talk, I will present an exactly solvable model called "Diffusion with Stochastic Resetting'' that describes such searches with resets and demonstrate the effect of introducing costs to resets. I will begin with the model of stochastic resetting and how it compares with standard diffusive processes without resets. Then, I will present the exact analytic results of introducing costs to searches with stochastic resetting and determine the optimal resetting rate for such processes. Finally, I will discuss phase transitions that occur in the resetting strategy for these search processes.

References

1. M. R. Evans, S. N. Majumdar and G. Schehr, Stochastic resetting and applications, J. Phys. A: Math. Theor. 53 , 193001 (2020)
2. J. C. Sunil, R. A. Blythe, M. R. Evans and S. N. Majumdar, The cost of stochastic resetting, J. Phys. A: Math. Theor. 56, 395001 (2023)

Join Zoom Meeting
https://ed-ac-uk.zoom.us/j/81211470751

Meeting ID: 812 1147 0751
Passcode: ICMCS123