Lazy random walks on the weighted pseudofractal scale-free networks with a perfect trap.

Saved in:
Bibliographic Details
Title: Lazy random walks on the weighted pseudofractal scale-free networks with a perfect trap.
Authors: Chen, Yun1 (AUTHOR) yunc_c2233@163.com, Wu, Bo2 (AUTHOR), Peng, Qingsong1 (AUTHOR), Liu, Wei1 (AUTHOR), Cao, Shanyong1 (AUTHOR)
Source: International Journal of Modern Physics C: Computational Physics & Physical Computation. Jul2026, Vol. 37 Issue 7, p1-13. 13p.
Subjects: Random walks, Scale-free network (Statistical physics), Network performance, Fractals, Particle dynamics, Computer simulation, Weighted graphs
Abstract: This paper investigates the average trapping time problem of particles performing lazy random walks on a weighted scale-free pseudofractal network. We introduced three different parameters, namely, the weight r of the edge during iteration, the probability p of particles jumping at the old node position, and the probability q of particles jumping at the new node position. By analyzing the behavior of particles at different node positions, the analytical expression for the average trapping time was obtained. Based on the analytical expression, numerical simulation graph is drawn for different parameters, and the results showed that particles using lazy random walks can improve transmission efficiency. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Modern Physics C: Computational Physics & Physical Computation is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:This paper investigates the average trapping time problem of particles performing lazy random walks on a weighted scale-free pseudofractal network. We introduced three different parameters, namely, the weight r of the edge during iteration, the probability p of particles jumping at the old node position, and the probability q of particles jumping at the new node position. By analyzing the behavior of particles at different node positions, the analytical expression for the average trapping time was obtained. Based on the analytical expression, numerical simulation graph is drawn for different parameters, and the results showed that particles using lazy random walks can improve transmission efficiency. [ABSTRACT FROM AUTHOR]
ISSN:01291831
DOI:10.1142/S0129183125501189