Optimizing Cost through Dynamic Stochastic Resetting
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913567165382656 |
|---|---|
| author | Gupta, Deepak Cleuren, Bart |
| author_facet | Gupta, Deepak Cleuren, Bart |
| contents | The cost of stochastic resetting is considered within the context of a discrete random walk model. In addition to standard stochastic resetting, for which a reset occurs with a certain probability after \emph{each} step, we introduce a novel resetting protocol which we dubbed {\it dynamic resetting}. This protocol entails an additional dynamic constraint related to the direction of successive steps of the random walker. We study this novel protocol for a one-dimensional random walker on an infinite lattice. We analyze the impact of the constraint on the walker's mean-first passage time and the cost (fluctuations) of the resets as a function of distance of target from the resetting location. Further, cost optimized search strategies are discussed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_22255 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimizing Cost through Dynamic Stochastic Resetting Gupta, Deepak Cleuren, Bart Statistical Mechanics Soft Condensed Matter The cost of stochastic resetting is considered within the context of a discrete random walk model. In addition to standard stochastic resetting, for which a reset occurs with a certain probability after \emph{each} step, we introduce a novel resetting protocol which we dubbed {\it dynamic resetting}. This protocol entails an additional dynamic constraint related to the direction of successive steps of the random walker. We study this novel protocol for a one-dimensional random walker on an infinite lattice. We analyze the impact of the constraint on the walker's mean-first passage time and the cost (fluctuations) of the resets as a function of distance of target from the resetting location. Further, cost optimized search strategies are discussed. |
| title | Optimizing Cost through Dynamic Stochastic Resetting |
| topic | Statistical Mechanics Soft Condensed Matter |
| url | https://arxiv.org/abs/2410.22255 |