Adding a single memory per agent gives the fastest average consensus
Résumé
Previous papers have proposed to add memory registers to the individual dynamics of discrete-time linear agents to move faster towards average consensus under interactions dictated by a given but unknown graph. They have proved that adding one memory slot per agent allows faster convergence. We here prove that this situation cannot be improved by adding more memory slots. We conclude by discussing a more general framework for our result in an algorithmic context.
Origine : Fichiers produits par l'(les) auteur(s)