Skip to Main content Skip to Navigation
New interface
Conference papers

A resistance-based approach to performance analysis of the consensus algorithm

Enrico Lovisari 1, * Federica Garin 2 Sandro Zampieri 1 
* Corresponding author
2 NECS - Networked Controlled Systems
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
Abstract : We study the well-known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. In order to do this, we recall the analogy between Markov Chains and electrical resistive networks. By exploiting this analogy, we are able to rewrite the performance cost as the average effective resistance on a suitable network. We use this result to show that if the communication graph fulfills some local properties, then its behavior can be approximated with that of a suitable grid, over which the behavior of the cost is known.
Complete list of metadata
Contributor : Federica Garin Connect in order to contact the contributor
Submitted on : Tuesday, November 9, 2010 - 6:22:47 PM
Last modification on : Friday, November 25, 2022 - 7:07:32 PM


  • HAL Id : inria-00534491, version 1



Enrico Lovisari, Federica Garin, Sandro Zampieri. A resistance-based approach to performance analysis of the consensus algorithm. MTNS 2010 - 19th International Symposium on Mathematical Theory of Networks and Systems, Jul 2010, Budapest, Hungary. ⟨inria-00534491⟩



Record views