Laplacian-based matrix design for finite-time average consensus in digraphs

Themistoklis Charalambous, Christoforos N. Hadjicostis

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

80 Downloads (Pure)


In this paper, we consider the problem of assigning time-varying weights on the links of a time-invariant digraph, such that average consensus is reached in a finite number of steps. More specifically, we derive a finite set of weight matrices that are based on the Laplacian and the Laplacian eigenvalues of the given digraph, such that the product of these weight matrices (in any order) leads to a rank-one matrix. Using the weights associated with this sequence of weight matrices, the nodes run two linear iterations (each with its own initial conditions) and, after a finite number of steps, can calculate the average of the initial values by taking the ratio of the two values they possess at the end of the iteration process. As in the case of undirected graphs, we show that the set of matrices depends on the number of nonzero distinct eigenvalues of the Laplacian matrix. However, unlike the case for undirected graphs, the Laplacian matrix is no longer symmetric, and the number of steps depends not only on the number of distinct eigenvalues but also on their algebraic multiplicities. Illustrative examples demonstrate the validity of the derived results.

Original languageEnglish
Title of host publication2018 IEEE Conference on Decision and Control, CDC 2018
Number of pages6
ISBN (Electronic)9781538613955
Publication statusPublished - 18 Jan 2019
MoE publication typeA4 Article in a conference publication
EventIEEE Conference on Decision and Control - Miami, United States
Duration: 17 Dec 201819 Dec 2018
Conference number: 57

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546


ConferenceIEEE Conference on Decision and Control
Abbreviated titleCDC
Country/TerritoryUnited States


  • Finite-time average consensus
  • Laplacian-based matrix design
  • Digraphs


Dive into the research topics of 'Laplacian-based matrix design for finite-time average consensus in digraphs'. Together they form a unique fingerprint.

Cite this