1.8k citations
- Fudan UniversityCN78 papers
- Leibniz University HannoverDE62 papers
- Chinese Academy of SciencesCN59 papers
- National University of SingaporeSG46 papers
- University of Chinese Academy of SciencesCN45 papers
- Università di CamerinoIT41 papers
- Centre National de la Recherche ScientifiqueFR40 papers
- Peking UniversityCN35 papers
- Hong Kong Polytechnic UniversityHK34 papers
- The University of TokyoJP33 papers
- King's College LondonGB32 papers
- Tsinghua UniversityCN32 papers
6 papers · 2 filters
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…
Anomalous behavior of trapping on a fractal scale-free network
Zhongzhi Zhang, Wenlei Xie, Shuigeng Zhou +2
It is known that the heterogeneity of scale-free networks helps enhancing the efficiency of trapping processes performed on them. In this paper, we show that transport efficiency i…
Random walks on the Apollonian network with a single trap
Zhongzhi Zhang, Jihong Guan, Wenlei Xie +2
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonia…
Exact solution for mean first-passage time on a pseudofractal scale-free web
Zhongzhi Zhang, Yi Qi, Shuigeng Zhou +2
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals…
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…