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

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

doi:10.1109/TCNS.2015.2428411

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 journal › Article › Scientific › peer-review

86 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 language	English
Article number	7100912
Pages (from-to)	137-148
Number of pages	12
Journal	IEEE Transactions on Control of Network Systems
Volume	3
Issue number	2
DOIs	https://doi.org/10.1109/TCNS.2015.2428411
Publication status	Published - 1 Jun 2016
MoE publication type	A1 Journal article-refereed

Keywords

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

Access to Document

10.1109/TCNS.2015.2428411

Cite this

@article{9be2c4c88abf47329908d7fa64f914e2,

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

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.",

keywords = "distributed finite-time algorithms, left-eigenvector, network parameter computation, out-degree, spectrum",

author = "Themistoklis Charalambous and Rabbat, {Michael G.} and Mikael Johansson and Hadjicostis, {Christoforos N.}",

year = "2016",

month = jun,

day = "1",

doi = "10.1109/TCNS.2015.2428411",

language = "English",

volume = "3",

pages = "137--148",

journal = "IEEE Transactions on Control of Network Systems",

issn = "2372-2533",

publisher = "IEEE",

number = "2",

}

TY - JOUR

T1 - Distributed Finite-Time Computation of Digraph Parameters

T2 - Left-Eigenvector, Out-Degree and Spectrum

AU - Charalambous, Themistoklis

AU - Rabbat, Michael G.

AU - Johansson, Mikael

AU - Hadjicostis, Christoforos N.

PY - 2016/6/1

Y1 - 2016/6/1

N2 - 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.

AB - 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.

KW - distributed finite-time algorithms

KW - left-eigenvector

KW - network parameter computation

KW - out-degree

KW - spectrum

UR - http://www.scopus.com/inward/record.url?scp=84978160951&partnerID=8YFLogxK

U2 - 10.1109/TCNS.2015.2428411

DO - 10.1109/TCNS.2015.2428411

M3 - Article

AN - SCOPUS:84978160951

SN - 2372-2533

VL - 3

SP - 137

EP - 148

JO - IEEE Transactions on Control of Network Systems

JF - IEEE Transactions on Control of Network Systems

IS - 2

M1 - 7100912

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this