Relative tempo of distributed averaging on networks

• Autores: Haibin Shao, Lulu Pan-, Mehran Mesbahi, Yugeng Xi--, Dewei Li
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Nº. 105, 2019, págs. 159-166
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Distributed averaging has applications in a wide range of distributed algorithms. This paper introduces relative tempo for distributed averaging on networks, revealing a novel facet of the consensus problem. Intuitively, the relative tempo characterizes the relative rate of change in state of a pair of subgroups of agents in a network adopting distributed averaging. We show that there exists a quantitative link between the relative tempo and the eigenvector corresponding to the second largest eigenvalue of the row-stochastic matrix related to the underlying network. We further show that the dominant mode of a distributed averaging process can be efficiently estimated by utilizing the relative tempo. Distributed neighbor selection protocols are further proposed for the reduction of network topology, with potential applications in the context of fast consensus and eliminating the influence of network intruders. The correlation between relative tempo and network symmetry is also examined. Numerical simulation is provided to demonstrate the theoretical results.