activity
20052025
most citedFocusing Attention: Towards Accurate Text Recognition in Natural Images

584 citations · 2.6k across the 83 of their papers we have counts for

collaborators
Showing 2009Show all

16 papers · 1 filter

physics.soc-ph2009★ 8 cited

An alternative approach to determining average distance in a class of scale-free modular networks

Zhongzhi Zhang, Yuan Lin, Shuigeng Zhou +2

Various real-life networks of current interest are simultaneously scale-free and modular. Here we study analytically the average distance in a class of deterministically growing sc…

cond-mat.dis-nn2009★ 2 cited

Analytic Solution to Clustering Coefficients on Weighted Networks

Yichao Zhang, Zhongzhi Zhang, Jihong Guan +1

Clustering coefficient is an important topological feature of complex networks. It is, however, an open question to give out its analytic expression on weighted networks yet. Here…

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…

cond-mat.stat-mech2009★ 66 cited

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…

physics.soc-ph2009★ 19 cited

Prisoner's dilemma in structured scale-free networks

Xing Li, Yonghui Wu, Zhihai Rong +2

The conventional wisdom is that scale-free networks are prone to cooperation spreading. In this paper we investigate the cooperative behaviors on the structured scale-free network.…

cond-mat.stat-mech2009★ 10 cited

Contact graphs of disk packings as a model of spatial planar networks

Zhongzhi Zhang, Jihong Guan, Bailu Ding +2

Spatially constrained planar networks are frequently encountered in real-life systems. In this paper, based on a space-filling disk packing we propose a minimal model for spatial m…

cond-mat.stat-mech2009★ 30 cited

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…

cond-mat.dis-nn2009★ 29 cited

A unified model for Sierpinski networks with scale-free scaling and small-world effect

Jihong Guan, Yuewen Wu, Zhongzhi Zhang +2

In this paper, we propose an evolving Sierpinski gasket, based on which we establish a model of evolutionary Sierpinski networks (ESNs) that unifies deterministic Sierpinski networ…

cond-mat.stat-mech2009★ 59 cited

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…

q-bio.PE2009

Epidemic spreading with nonlinear infectivity in weighted scale-free networks

Xiangwei Chu, Zhongzhi Zhang, Jihong Guan +1

In this paper, we investigate the epidemic spreading for SIR model in weighted scale-free networks with nonlinear infectivity, where the transmission rate in our analytical model i…

cond-mat.stat-mech2009★ 120 cited

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…

cond-mat.stat-mech2009★ 25 cited

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…