66 citations · 303 across the 8 of their papers we have counts for
8 papers
Role of fractal dimension in random walks on scale-free networks
Zhongzhi Zhang, Yihang Yang, Shuyang Gao
Fractal dimension is central to understanding dynamical processes occurring on networks; however, the relation between fractal dimension and random walks on fractal scale-free netw…
Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks
Zhongzhi Zhang, Shuyang Gao
A lot of previous work showed that the sectional mean first-passage time (SMFPT), i.e., the average of mean first-passage time (MFPT) for random walks to a given hub node (node wit…
Impact of degree heterogeneity on the behavior of trapping in Koch networks
Zhongzhi Zhang, Shuyang Gao, Wenlei Xie
Previous work shows that the mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) in uncorrelated random scale-free networks is closely re…
Average distance in a hierarchical scale-free network: an exact solution
Zhongzhi Zhang, Yuan Lin, Shuyang Gao +2
Various real systems simultaneously exhibit scale-free and hierarchical structure. In this paper, we study analytically average distance in a deterministic scale-free network with…
Trapping in scale-free networks with hierarchical organization of modularity
Zhongzhi Zhang, Yuan Lin, Shuyang Gao +3
A wide variety of real-life networks share two remarkable generic topological properties: scale-free behavior and modular organization, and it is natural and important to study how…
Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
Zhongzhi Zhang, Yi Qi, Shuigeng Zhou +2
The determination of mean first-passage time (MFPT) for random walks in networks is a theoretical challenge, and is a topic of considerable recent interest within the physics commu…