Resistance-based performance analysis of the consensus algorithm over geometric graphs

Abstract : The performance of the linear consensus algorithm is studied by using a linear quadratic (LQ) cost. The objective is to understand how the communication topology influences this algorithm. This is achieved by exploiting the analogy between Markov chains and electrical resistive networks. Indeed, this allows us to uncover the relation between the LQ performance cost and the average effective resistance of a suitable electrical network and, moreover, to show that if the communication graph fulfills some local properties, then its behavior can be approximated by that of a grid, which is a graph whose associated LQ cost is well known.
Type de document :
Article dans une revue
SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2013, 51 (5), pp.3918-3945. 〈10.1137/110857428〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00877382
Contributeur : Federica Garin <>
Soumis le : lundi 28 octobre 2013 - 13:41:40
Dernière modification le : mardi 10 juillet 2018 - 01:18:45

Lien texte intégral

Identifiants

Citation

Enrico Lovisari, Federica Garin, Sandro Zampieri. Resistance-based performance analysis of the consensus algorithm over geometric graphs. SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2013, 51 (5), pp.3918-3945. 〈10.1137/110857428〉. 〈hal-00877382〉

Partager

Métriques

Consultations de la notice

329