Convergence speed of consensus problems over undirected scale-free networks

Scale-free networks and consensus behaviour among multiple agents have both attracted much attention.To investigate the consensus speed over scale-free networks is the major topic of the present work.A novel method is developed to construct scale-free networks due to their remarkable power-law degree distributions,while preserving the diversity of network topologies.The time cost or iterations for networks to reach a certain level of consensus is discussed,considering the influence from power-law parameters.They are both demonstrated to be reversed power-law functions of the algebraic connectivity,which is viewed as a measurement on convergence speed of the consensus behaviour.The attempts of tuning power-law parameters may speed up the consensus procedure,but it could also make the network less robust over time delay at the same time.Large scale of simulations are supportive to the conclusions.