Consensus in Scale-free Networks

This paper investigate consensus problems in an extended scale-free network model. It is found that as the network becomes more homogeneous, the convergence speed decreased; however, the maximal tolerate delay time of the network achieving consensus is increased. Therefore, there is a trade-off between the speed of achieving consensus and the robust to the delay time.

[1]  Joel E. Cohen,et al.  Community Food Webs: Data and Theory , 1990 .

[2]  Neo D. Martinez,et al.  Simple rules yield complex food webs , 2000, Nature.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[5]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[6]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[7]  R. Murray,et al.  Consensus protocols for networks of dynamic agents , 2003, Proceedings of the 2003 American Control Conference, 2003..

[8]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[9]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[10]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[11]  S. Redner,et al.  Finiteness and fluctuations in growing networks , 2002, cond-mat/0207107.