Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks
From MaRDI portal
Publication:2979352
DOI10.1109/TAC.2016.2539547zbMATH Open1359.81082arXiv1504.01438OpenAlexW2962958741MaRDI QIDQ2979352FDOQ2979352
Tamer Başar, Alex Olshevsky, Seyed Rasoul Etesami
Publication date: 3 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1504.01438
Cited In (7)
- A Simple Framework for Stability Analysis of State-Dependent Networks of Heterogeneous Agents
- An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs
- Synchronization of coupled harmonic oscillators using quantized sampled position data
- Duality and Stability in Complex Multiagent State-Dependent Network Dynamics
- Non-oscillating quantized average consensus over dynamic directed topologies
- Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal
- Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks
This page was built for publication: Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979352)
