most citedEfficient routing on complex networks

636 citations · 910 across the 13 of their papers we have counts for

collaborators
Showing cond-mat.stat-mechShow all

5 papers · 1 filter

cond-mat.stat-mech200540 cited

Better Synchronizability Predicted by Crossed Double Cycle

Tao Zhou, Ming Zhao, Bing-Hong Wang

In this brief report, we propose a network model named crossed double cycles, which are completely symmetrical and can be considered as the extensions of nearest-neighboring lattic…

cond-mat.stat-mech200539 cited

Self-organized Boolean game on networks

Tao Zhou, Bing-Hong Wang, Pei-Ling Zhou +2

A model of Boolean game with only one free parameter that denotes the strength of herd behavior is proposed where each agent acts according to the information obtained from his…

cond-mat.stat-mech2005101 cited

Enhance synchronizability by structural perturbations

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

In this paper, we investigate the collective synchronization of system of coupled oscillators on Barabási-Albert scale-free network. We propose an approach of structural perturbati…

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-mech200413 cited

Analytical Studies on a Modified Nagel-Schreckenberg Model with the Fukui-Ishibashi Acceleration Rule

Chuan-Ji Fu, Chuan-Yang Yin, Tao Zhou +3

We propose and study a one-dimensional traffic flow cellular automaton model of high-speed vehicles with the Fukui-Ishibashi-type (FI) acceleration rule for all cars, and the Nagel…