Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TAC.2016.2539547 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Convergence,Protocols,Upper bound,Markov processes,Registers,Temperature measurement,Harmonic analysis | Convergence (routing),Consensus,Graph,Discrete mathematics,Mathematical optimization,Compact convergence,Quantization (physics),Poisson distribution,Mathematics,Modes of convergence | Journal |
Volume | Issue | ISSN |
61 | 12 | 0018-9286 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tamer Basar | 1 | 3497 | 402.11 |
| Seyed Rasoul Etesami | 2 | 33 | 7.29 |
| Alex Olshevsky | 3 | 1227 | 87.77 |