Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks
From MaRDI portal
Publication:2162066
DOI10.1016/j.physa.2019.121476MaRDI QIDQ2162066
Huixian Yang, Meifeng Dai, Yu Sun, Yong-Xia Hao
Publication date: 5 August 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2019.121476
average weighted receiving time; biased walk; double-weighted hierarchical network; mean weighted first-passing time
82-XX: Statistical mechanics, structure of matter
Related Items
Cites Work
- Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
- Trapping on modular scale-free and small-world networks with multiple hubs
- Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
- Generating hierarchial scale-free graphs from fractals
- Scaling of average sending time on weighted Koch networks
- Random walks on non-homogenous weighted Koch networks
- Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks
- A class of scale-free networks with fractal structure based on subshift of finite type
- A SMALL-WORLD AND SCALE-FREE NETWORK GENERATED BY SIERPINSKI TETRAHEDRON