Distributed weight balancing over digraphs

Apostolos I. Rikos, Themistoklis Charalambous, Christoforos N. Hadjicostis

Research output: Contribution to journalArticleScientificpeer-review

30 Citations (Scopus)


A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role in a number of applications, including cooperative control, distributed optimization, and distributed averaging. We propose distributed algorithms that operate over static topologies, for solving the weight-balancing problem when the weights are either non-negative real numbers or when they are restricted to be non-negative integers. For the case of real weights, the proposed algorithm is shown to admit a geometric convergence rate. For the case of integer weights, the proposed algorithm is shown to converge after a finite number of iterations that we explicitly bound. We also provide examples to illustrate the operation, performance, and potential advantages of the proposed algorithms.

Original languageEnglish
Article number6815657
Pages (from-to)190-201
Number of pages12
JournalIEEE Transactions on Control of Network Systems
Issue number2
Publication statusPublished - 1 Jun 2014
MoE publication typeA1 Journal article-refereed

Fingerprint Dive into the research topics of 'Distributed weight balancing over digraphs'. Together they form a unique fingerprint.

  • Cite this