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 Lp 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. © 2011 IEEE.
| Original language | English |
|---|---|
| Article number | 5692817 |
| Pages (from-to) | 1203-1207 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 56 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - May 2011 |
Research Keywords
- Consensus
- random network
- stability
- stochastic matrix
Fingerprint
Dive into the research topics of 'On the equivalence and condition of different consensus over a random network generated by i.i.d. stochastic matrices'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver