# Convergence Time of Quantized Metropolis Consensus Over Time-Varying Networks

arXiv: https://arxiv.org/abs/1504.01438 · HTML: https://mlsanity.com/paper/1504.01438/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Apr 2015.

## Built on by (most cited first, 1 of 1)

- [Decentralized Multi-Task Stochastic Optimization With Compressed Communications](https://mlsanity.com/paper/2112.12373/) (2021)

## Abstract (arXiv)

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.