dc.contributor.author | Charalambous, T. | en |
dc.contributor.author | Rabbat, M. G. | en |
dc.contributor.author | Johansson, M. | en |
dc.contributor.author | Hadjicostis, Christoforos N. | en |
dc.creator | Charalambous, T. | en |
dc.creator | Rabbat, M. G. | en |
dc.creator | Johansson, M. | en |
dc.creator | Hadjicostis, Christoforos N. | en |
dc.date.accessioned | 2019-04-08T07:45:22Z | |
dc.date.available | 2019-04-08T07:45:22Z | |
dc.date.issued | 2016 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/43148 | |
dc.description.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. © 2015 IEEE. | en |
dc.source | IEEE Transactions on Control of Network Systems | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978160951&doi=10.1109%2fTCNS.2015.2428411&partnerID=40&md5=ac4321aff47458089561b1659b4bd22c | |
dc.subject | Distributed computer systems | en |
dc.subject | Algorithms | en |
dc.subject | Parameter estimation | en |
dc.subject | Interconnected nodes | en |
dc.subject | Eigenvalues and eigenfunctions | en |
dc.subject | Adjacency matrices | en |
dc.subject | Distributed computations | en |
dc.subject | Distributed finite-time algorithms | en |
dc.subject | Distributed parameter networks | en |
dc.subject | Distributed strategies | en |
dc.subject | Finite time | en |
dc.subject | Left-eigenvector | en |
dc.subject | Network parameter computation | en |
dc.subject | Network parameters | en |
dc.subject | Out-degree | en |
dc.subject | Spectrum | en |
dc.title | Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1109/TCNS.2015.2428411 | |
dc.description.volume | 3 | |
dc.description.issue | 2 | |
dc.description.startingpage | 137 | |
dc.description.endingpage | 148 | |
dc.author.faculty | Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Article | en |
dc.source.abbreviation | IEEE Trans.Control Netw.Syst. | en |
dc.contributor.orcid | Hadjicostis, Christoforos N. [0000-0002-1706-708X] | |
dc.gnosis.orcid | 0000-0002-1706-708X | |