Abstract
Recent advances in complex network research have stimulated increasing interest in understanding the relationship between the topology and dynamics of complex networks. In this paper, we investigate the consensus problem in a class of scale-free network with a heterogeneity parameter. It is found that, for a scale-free network, the time to reach a consensus is hundreds of times shorter than that of the nearest-neighbor coupled network with the same average degree and network size, and its robustness to the node-failure and edge-failure is increased at the same time. Furthermore, as the scale-free network becomes more homogenous, or its average degree becomes larger, the time to reach a consensus will become shorter, but not notably shorter. Therefore, the scale-free network with a larger exponent r and average degree k is a better choice to obtain a faster convergence speed in the consensus problem.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
