Rearranging trees for robust consensus
Preprint
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 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.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Consensus Decision Making by FishCurrent Biology, 2008
- The six classes of trees with the largest algebraic connectivityDiscrete Applied Mathematics, 2008
- Effect of topological dimension on rigidity of vehicle formations: Fundamental limitations of local feedback2008
- Consensus problem in multi-agent systems with physical position neighbourhood evolving networkPhysica A: Statistical Mechanics and its Applications, 2007
- Distributed average consensus with least-mean-square deviationJournal of Parallel and Distributed Computing, 2007
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Resistance distance and Laplacian spectrumTheoretical Chemistry Accounts, 2003
- Wiener Index of Trees: Theory and ApplicationsActa Applicandae Mathematicae, 2001
- Ordering trees by algebraic connectivityGraphs and Combinatorics, 1990
- The modeling of chemical phenomena using topological indicesJournal of Computational Chemistry, 1987