100 citations · 206 across the 4 of their papers we have counts for
4 papers · 1 filter
Determining mean first-passage time on a class of treelike regular fractals
Yuan Lin, Bin Wu, Zhongzhi Zhang
Relatively general techniques for computing mean first-passage time (MFPT) of random walks on networks with a specific property are very useful, since a universal method for calcul…
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…
Mean first-passage time for random walks on the T-graph
Zhongzhi Zhang, Yuan Lin, Shuigeng Zhou +2
For random walks on networks (graphs), it is a theoretical challenge to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs. In this p…
Recursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networks
Zhongzhi Zhang, Yi Qi, Shuigeng Zhou +2
The complete knowledge of Laplacian eigenvalues and eigenvectors of complex networks plays an outstanding role in understanding various dynamical processes running on them; however…