Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks

DOI10.1109/TAC.2016.2539547MaRDI QIDQ2979352zbMATH OpenOpenAlexFDO

Authors Tamer Başar, Seyed Rasoul Etesami, Alex Olshevsky

Publication date 3 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.01438

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Quantum computation (81P68)

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.

Cited in

(7)

• Maximizing convergence time in network averaging dynamics subject to edge removal
• 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
• A simple framework for stability analysis of state-dependent networks of heterogeneous agents
• Non-oscillating quantized average consensus over dynamic directed topologies
• 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)