Gossip consensus algorithms via quantized communication

By Ruggero Carli, Fabio Fagnani, Paolo Frasca, Sandro Zampieri. 2009

238 citations recorded by the source corpus.

This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise ''gossip'' communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quantizer, and whether they should use, and how, exact information regarding their own states in the update.

Subfields: Computer Networks and Communications, Management Science and Operations Research, Algorithms & Complexity, Network Science & Complex Systems

How researchers see this paper

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

In Computer Networks and Communications

  1. Ji Liu
  2. Ce Zhang
  3. Martin Jaggi
  4. Sebastian U. Stich
  5. Xiangru Lian
  6. Anastasia Koloskova
  7. Javad Lavaei
  8. Tao Lin

In Management Science and Operations Research

  1. Sebastian U. Stich
  2. Ji Liu
  3. Richard M. Murray
  4. Tao Lin
  5. Ce Zhang
  6. Cho-Jui Hsieh
  7. Tamer Basar
  8. Martin Jaggi

In Algorithms & Complexity

  1. Richard M. Murray
  2. Tao Lin
  3. Javad Lavaei
  4. Ce Zhang
  5. Cho-Jui Hsieh
  6. Sebastian U. Stich
  7. Tamer Basar
  8. Martin Jaggi

In Network Science & Complex Systems

  1. Ce Zhang
  2. Xiangru Lian
  3. Ji Liu
  4. Javad Lavaei
  5. Richard M. Murray
  6. Sebastian U. Stich
  7. Martin Jaggi
  8. Anastasia Koloskova

Citations in the corpus