activity
20042007
most citedEfficient routing on complex networks

636 citations · 1.9k across the 20 of their papers we have counts for

collaborators
Showing 2004Show all

5 papers · 1 filter

cond-mat.stat-mech2004★ 272 cited

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.dis-nn2004★ 8 cited

Random Apollonian Networks

Tao Zhou, Gang Yan, Pei-Ling Zhou +2

In this letter, 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 R…

cond-mat.stat-mech2004★ 1 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★ 215 cited

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…

cond-mat.dis-nn2004★ 1 cited

Epidemic spread in weighted networks

G. Yan, Tao Zhou, Jie Wang +2

We study the detailed epidemic spreading process in scale-free networks with weight that denote familiarity between two people or computers. The result shows that spreading velocit…