Accelerating consensus by spectral clustering and polynomial filters - Université Pierre et Marie Curie Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Control of Network Systems Année : 2016

Accelerating consensus by spectral clustering and polynomial filters

Simon Apers
Alain Sarlette
  • Fonction : Auteur
  • PersonId : 10453
  • IdHAL : asarlet

Résumé

It is known that polynomial filtering can accelerate the convergence towards average consensus on an undirected network. In this paper the gain of a second-order filtering is investigated in more detail. A set of graphs is determined for which consensus can be attained in finite time, and a preconditioner is proposed to adapt the undirected weights of any given graph to achieve fastest convergence with the polynomial filter. The corresponding cost function differs from the traditional spectral gap, as it favors grouping the eigenvalues in two clusters and can favor symmetry breaking. A possible loss of robustness of the polynomial filter is also highlighted.
Fichier principal
Vignette du fichier
p2acc-IEEE.pdf (233.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01093939 , version 1 (28-12-2015)

Identifiants

Citer

Simon Apers, Alain Sarlette. Accelerating consensus by spectral clustering and polynomial filters. IEEE Transactions on Control of Network Systems, 2016, ⟨10.1109/TCNS.2016.2520885⟩. ⟨hal-01093939⟩
224 Consultations
121 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More