Cover times with 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_ | 1866912368970170368 |
|---|---|
| author | Linn, Samantha Lawley, Sean D |
| author_facet | Linn, Samantha Lawley, Sean D |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_12154 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cover times with stochastic resetting Linn, Samantha Lawley, Sean D Probability Statistical Mechanics 60G07, 60G70, 60J27, 60J60, 60J65 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. |
| title | Cover times with stochastic resetting |
| topic | Probability Statistical Mechanics 60G07, 60G70, 60J27, 60J60, 60J65 |
| url | https://arxiv.org/abs/2406.12154 |