Rearranging trees for robust consensus
Authors:
- 1 December 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1000-1005
Abstract
In this paper, we use the ℋ 2 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 ℋ 2 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 16 references indexed in Scilit:
- Robustness of Aggregation in Networked Dynamical Systems2009
- Consensus problem in multi-agent systems with physical position neighbourhood evolving networkPhysica A: Statistical Mechanics and its Applications, 2007
- Indices of trees with a prescribed diameterApplicable Analysis and Discrete Mathematics, 2007
- A survey of consensus problems in multi-agent coordination2005
- Stability of multiagent systems with time-dependent communication linksIEEE Transactions on Automatic Control, 2005
- 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
- Resistance distanceJournal of Mathematical Chemistry, 1993
- The modeling of chemical phenomena using topological indicesJournal of Computational Chemistry, 1987