arXiv:1105.2541 [math.OC]AbstractReferencesReviewsResources
Rearranging trees for robust consensus
George Forrest Young, Luca Scardovi, Naomi Ehrich Leonard
Published 2011-05-12, updated 2011-06-20Version 2
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 by systematic attention to the effect of local changes in topology, we derive a partial ordering for undirected trees according to the H2 norm. Our approach for undirected trees provides a constructive method for deriving an ordering for directed trees. Further, our approach suggests a decentralized manner in which trees can be rearranged in order to improve their robustness.
Comments: Submitted to CDC 2011
Related articles:
arXiv:1309.7264 [math.OC] (Published 2013-09-27)
Robust Consensus in Distributed Networks using Total Variation
arXiv:2401.14158 [math.OC] (Published 2024-01-25)
A robust consensus + innovations-based distributed parameter estimator