activity
20042007
most citedEfficient routing on complex networks

636 citations · 660 across the 8 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

5 papers · 1 filter

cond-mat.stat-mech2005

Relations between Average Distance, Heterogeneity and Network Synchronizability

Ming Zhao, Tao Zhou, Bing-Hong Wang +3

By using the random interchanging algorithm, we investigate the relations between average distance, standard deviation of degree distribution and synchronizability of complex netwo…

cond-mat.stat-mech20054 cited

Simplex triangulation induced scale-free networks

Zhi-Ming Gu, Tao Zhou, Bing-Hong Wang +3

We propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called simplex triangulation…

cond-mat.stat-mech2004

Maximal planar networks with large clustering coefficient and power-law degree distribution

Tao Zhou, Gang Yan, Bing-Hong Wang

In this article, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called {\bf…

cond-mat.stat-mech20041 cited

Self-Organization Induced Scale-Free Networks

Gang Yan, Tao Zhou, Ying-Di Jin +1

What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges f…

cond-mat.stat-mech2004

Epidemic spread in weighted scale-free networks

Gang Yan, Tao Zhou, Jie Wang +2

In this letter, we investigate the detailed epidemic spreading process in scale-free networks with links' weights that denote familiarity between two individuals and find that spre…