activity
20042007
most citedEfficient routing on complex networks

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

collaborators
Showing cond-mat.dis-nnShow all

8 papers · 1 filter

cond-mat.dis-nn2006★ 71 cited

Synchronization on community networks

Tao Zhou, Ming Zhao, Guanrong Chen +2

In this Letter, we propose a growing network model that can generate scale-free networks with a tunable community strength. The community strength, , is directly measured by the…

cond-mat.dis-nn2006

Dynamical Coarse Graining of Large Scale-Free Boolean networks

Wen-Xu Wang, Gang Yan, Jie Ren +1

We present a renormalization-grouplike method performed in the state space for detecting the dynamical behaviors of large scale-free Boolean networks, especially for the chaotic re…

cond-mat.dis-nn2005★ 44 cited

A Mutual Attraction Model for Both Assortative and Disassortative Weighted Networks

Wen-Xu Wang, Bo Hu, Bing-Hong Wang +1

In most networks, the connection between a pair of nodes is the result of their mutual affinity and attachment. In this letter, we will propose a Mutual Attraction Model to charact…

cond-mat.dis-nn2005

Weighted Network Models Based on Local and Global Rules

Bo Hu, Gang Yan, Wen-Xu Wang +1

We will introduce two evolving models that characterize weighted complex networks. Though the microscopic dynamics are different, these models are found to bear a similar mathemati…

cond-mat.dis-nn2005★ 636 cited

Efficient routing on complex networks

Gang Yan, Tao Zhou, Bo Hu +2

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a g…

cond-mat.dis-nn2005★ 249 cited

General Dynamics of Topology and Traffic on Weighted Technological Networks

Wen-Xu Wang, Bo Hu, Gang Yan +2

For most technical networks, the interplay of dynamics, traffic and topology is assumed crucial to their evolution. In this paper, we propose a traffic-driven evolution model of we…

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.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…