activity
20042009
most citedEfficient routing on complex networks

636 citations · 2.5k across the 44 of their papers we have counts for

collaborators
Showing 2004Show all

14 papers · 1 filter

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.other200426 cited

Clustering Evolutionary Stock Market Model

Jie Wang, Chun-Xia Yang, Pei-Ling Zhou +3

As a typical representation of complex networks studied relatively thoroughly, financial market presents some special details, such as its nonconservation and opinions spreading. I…

cond-mat.mtrl-sci2004

Continuous extremal optimization for Lennard-Jones Clusters

Tao Zhou, Wen-Jie Bai, Long-Jiu Cheng +1

In this paper, we explore a general-purpose heuristic algorithm for finding high-quality solutions to continuous optimization problems. The method, called continuous extremal optim…

cond-mat.dis-nn20048 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-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.dis-nn20043 cited

A weighted evolving network model more approach to reality

Chuan-Ji Fu, Qing Ou, Wen Chen +4

In search of many social and economical systems, it is found that node strength distribution as well as degree distribution demonstrate the behavior of power-law with droop-head an…