activity
20052025
most citedExact solution for mean first-passage time on a pseudofractal scale-free web

120 citations · 1.3k across the 63 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

22 papers · 1 filter

cond-mat.stat-mech2010★ 86 cited

Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices

Zhongzhi Zhang, Bin Wu, Hongjuan Zhang +3

The family of Vicsek fractals is one of the most important and frequently-studied regular fractal classes, and it is of considerable interest to understand the dynamical processes…

cond-mat.stat-mech2009★ 38 cited

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…

cond-mat.stat-mech2009★ 20 cited

Deterministic weighted scale-free small-world networks

Yichao Zhang, Zhongzhi Zhang, Shuigeng Zhou +1

We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the coevolution of topology and weight. In the model, we have the degree dis…

cond-mat.stat-mech2009★ 43 cited

Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence

Zhongzhi Zhang, Weilen Xie, Shuigeng Zhou +2

In general, the power-law degree distribution has profound influence on various dynamical processes defined on scale-free networks. In this paper, we will show that power-law degre…

cond-mat.stat-mech2009★ 44 cited

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…

cond-mat.stat-mech2009★ 43 cited

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…