Preprint Article Version 1 This version is not peer-reviewed

Random Walk on T-Fractal with Stochastic Resetting

Version 1 : Received: 22 October 2024 / Approved: 23 October 2024 / Online: 24 October 2024 (03:14:04 CEST)

How to cite: Sun, X.; Li, A.; Zhu, S.; Zhu, F. Random Walk on T-Fractal with Stochastic Resetting. Preprints 2024, 2024101771. https://doi.org/10.20944/preprints202410.1771.v1 Sun, X.; Li, A.; Zhu, S.; Zhu, F. Random Walk on T-Fractal with Stochastic Resetting. Preprints 2024, 2024101771. https://doi.org/10.20944/preprints202410.1771.v1

Abstract

In this study, we explore the impact of stochastic resetting on the dynamics of random walks on a T-fractal network. By employing the generating function technique, we establish a recursive relation between the generating function of the first passage time (FPT) and derive a relationship between the mean first passage time (MFPT) with resetting and the generating function of the FPT without resetting. Our analysis covers various scenarios for a random walker reaching a target site from the starting position, and for each case, we determine the optimal resetting probability γ* that minimizes the MFPT. We compare the results with the MFPT without resetting and find that the inclusion of resetting significantly enhances search efficiency, particularly as the size of the network increases. Our findings highlight the potential of stochastic resetting as an effective strategy for optimizing search processes in complex networks, offering valuable insights for applications in various fields where efficient search strategies are crucial.

Keywords

random walk; T-fractal; stochastic resetting; generating function; first passage time

Subject

Computer Science and Mathematics, Probability and Statistics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.