Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum

Themistoklis Charalambous, Michael G. Rabbat, Mikael Johansson, Christoforos N. Hadjicostis

Research output: Contribution to journalArticleScientificpeer-review

29 Citations (Scopus)

Abstract

Many of the algorithms that have been proposed in the field of distributed computation rely on assumptions that require nodes to be aware of some global parameters. In this paper, we propose algorithms to compute some network parameters in a distributed fashion and in a finite number of steps. More specifically, given an arbitrary strongly connected network of interconnected nodes, by adapting a distributed finite-time approach, we develop distributed strategies that enable nodes to compute the following network parameters: the left-eigenvector, the out-degree, and the spectrum of weighted adjacency matrices.

Original languageEnglish
Article number7100912
Pages (from-to)137-148
Number of pages12
JournalIEEE Transactions on Control of Network Systems
Volume3
Issue number2
DOIs
Publication statusPublished - 1 Jun 2016
MoE publication typeA1 Journal article-refereed

Keywords

  • distributed finite-time algorithms
  • left-eigenvector
  • network parameter computation
  • out-degree
  • spectrum

Fingerprint Dive into the research topics of 'Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum'. Together they form a unique fingerprint.

  • Cite this