Back to Search
Start Over
Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks.
- Source :
-
IEEE Transactions on Automatic Control . Dec2016, Vol. 61 Issue 12, p4048-4054. 7p. - Publication Year :
- 2016
-
Abstract
- We consider the quantized consensus problem on undirected time-varying connected graphs with $n$ nodes, and devise a protocol with fast convergence time to the set of consensus points. Specifically, we show that when the edges of each network in a sequence of connected time-varying networks are activated based on Poisson processes with Metropolis rates, the expected convergence time to the set of consensus points is at most O(n^{2}\log^{2}n), where each node performs a constant number of updates per unit time. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189286
- Volume :
- 61
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Automatic Control
- Publication Type :
- Periodical
- Accession number :
- 120010641
- Full Text :
- https://doi.org/10.1109/TAC.2016.2539547