On the Equivalence and Condition of Different Consensus Over a Random Network Generated by i.i.d. Stochastic Matrices
- 20 January 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 56 (5) , 1203-1207
Abstract
Our objective is to find a necessary and sufficient condition for consensus over a random network generated by i.i.d. stochastic matrices. We show that the consensus problem in all different types of convergence (almost surely, in probability, and in L p for every p ≥ 1) are actually equivalent, thereby obtain the same necessary and sufficient condition for all of them. The main technique we used is based on the stability in a projected subspace of the concerned infinite sequences.Keywords
This publication has 14 references indexed in Scilit:
- Consensus Over Ergodic Stationary Graph ProcessesIEEE Transactions on Automatic Control, 2009
- Stability of random-switching systems of differential equationsQuarterly of Applied Mathematics, 2009
- A Necessary and Sufficient Condition for Consensus Over Random NetworksIEEE Transactions on Automatic Control, 2008
- Distributed Consensus in Multi-vehicle Cooperative Control2008
- Distributed average consensus with least-mean-square deviationJournal of Parallel and Distributed Computing, 2007
- Agreement over random networksIEEE Transactions on Automatic Control, 2005
- Consensus seeking in multiagent systems under dynamically changing interaction topologiesIEEE Transactions on Automatic Control, 2005
- Information Flow and Cooperative Control of Vehicle FormationsIEEE Transactions on Automatic Control, 2004
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Novel Type of Phase Transition in a System of Self-Driven ParticlesPhysical Review Letters, 1995