On quantized consensus by means of gossip algorithm - Part II: Convergence time

44 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, background): “In [ 145], [146], quantized consensus was studied via the gossip algorithm, w ith both lower and upper bounds of the convergence time derived in terms of the network size.”
Gossip consensus algorithms via quantized communication (2009, background): “This fact has actually been proven for any ε ∈ (0, 1/2] in the pair of recent conference papers [10,11].”
Convergence Analysis of the Incremental Cost Consensus Algorithm Under Different Communication Network Topologies in a Smart Grid (2012, background): “Precisely speaking, the second smallest eigenvalue of the graph Laplacian, which is also known as the algebraic connectivity, is a measure of the convergence speed of the consensus algorithms [15].”
Gossip Algorithms for Distributed Signal Processing (2010, background): “The random gossip algorithm analyzed in [71] leads to a similar result, where the final consensus state differs at most by one bin from the true average; the same authors discuss bounds on the rate of convergence in [72].”
On quantized consensus by means of gossip algorithm - Part I: Convergence proof (2009, background): “The second part of the paper deals with the expected value of the time at which the consensus is reached [20].”