Random Walk on T-Fractal with Stochastic Resetting
Xiaohan Sun, Anlin Li, Shaoxiang Zhu, Feng Zhu, Alexander Iomin, José F F Mendes, Trifce Sandev · 2024
Read Random Walk on T-Fractal with Stochastic Resetting by Xiaohan Sun, Anlin Li, Shaoxiang Zhu, Feng Zhu, Alexander Iomin, José F F Mendes, Trifce Sandev (2024) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-11726722.txt.
Description
A random walker wandering a network can take a long time to find its target, and randomly teleporting back to the start sometimes speeds the hunt. Xiaohan Sun and co-authors study that trick, called stochastic resetting, on a branching network known as the T-fractal. Using generating functions, a bookkeeping tool for step counts, they link the time to first reach a target with and without resetting.
For each setup they compute the best resetting chance, the one that cuts the average arrival time the most. Resetting beat plain wandering in their tests, and the advantage grew as the network got larger. The mathematics shows why: occasional restarts cut off the walker's long, fruitless detours. The authors present resetting as a general strategy for faster search in complex networks, with uses wherever finding something quickly matters.
Catalog record
| CREATOR | Xiaohan Sun, Anlin Li, Shaoxiang Zhu, Feng Zhu, Alexander Iomin, José F F Mendes, Trifce Sandev |
|---|---|
| YEAR | 2024 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 38 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |