Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
2016 (English)In: IEEE Transactions on Control of Network Systems, ISSN 2325-5870, Vol. 3, no 2, 137-148 p., 7100912Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2016. Vol. 3, no 2, 137-148 p., 7100912
distributed finite-time algorithms, left-eigenvector, network parameter computation, out-degree, spectrum
IdentifiersURN: urn:nbn:se:kth:diva-194540DOI: 10.1109/TCNS.2015.2428411ISI: 000379600400004ScopusID: 2-s2.0-84978160951OAI: oai:DiVA.org:kth-194540DiVA: diva2:1043673
QC 201610312016-10-312016-10-312016-10-31Bibliographically approved