2008 Articles
A Necessary and Sufficient Condition for Consensus Over Random Networks
We consider the consensus problem for stochastic discrete-time linear dynamical systems. The underlying graph of such systems at a given time instance is derived from a random graph process, independent of other time instances. For such a framework, we present a necessary and sufficient condition for almost sure asymptotic consensus using simple ergodicity and probabilistic arguments. This easily verifiable condition uses the spectrum of the average weight matrix. Finally, we investigate a special case for which the linear dynamical system converges to a fixed vector with probability
Files
- TAC.2008.917743.pdf application/pdf 148 KB Download File
Also Published In
- Title
- IEEE Transactions on Automatic Control
- DOI
- https://doi.org/10.1109/TAC.2008.917743
More About This Work
- Academic Units
- Business
- Published Here
- September 7, 2011