Rearranging trees for robust consensus

Authors:
  • GYGeorge Forrest Young
    George Forrest Young
  • LSLuca Scardovi
    Luca Scardovi
  • NLNaomi Ehrich Leonard
    Naomi Ehrich Leonard

Abstract
In this paper, we use the H2 norm associated with a communication graph to characterize the robustness of consensus to noise. In particular, we restrict our attention to trees and derive a partial ordering according to their H2 norms. We prove that the performance of any tree will fall between that of the star and that of the path, and for trees with a fixed diameter, we find the tree with smallest H2 norm. Our results suggest a decentralized manner in which trees can be rearranged in order to improve their robustness.