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(n2log2n) , where each node performs a constant number of updates per unit time.
| Original language | English (US) |
|---|---|
| Article number | 7428833 |
| Pages (from-to) | 4048-4854 |
| Number of pages | 807 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 61 |
| Issue number | 12 |
| DOIs | |
| State | Published - Dec 2016 |
Keywords
- Convergence time
- Markov chains
- quantized consensus
- random walk
- spectral representation
- time varying networks
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering