On matrix factorization and scheduling for finite-time average-consensus

  • Authors:

  • Leonard J. Schulman;Chih-Kai Ko

  • Affiliations:

  • California Institute of Technology;California Institute of Technology

  • Venue:
  • On matrix factorization and scheduling for finite-time average-consensus
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problem of communication scheduling for finite-time average-consensus in arbitrary connected networks. Viewing this consensus problem as a factorization of $\M$ by network-admissible families of matrices, we prove the existence of finite factorizations, provide scheduling algorithms for finite-time average consensus, and derive almost tight lower bounds on the size of the minimal factorization.