Convergence speed of unsteady distributed consensus: decay estimate along the settling spanning-trees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Results for estimating the convergence rate of non-stationary distributed consensus algorithms are provided, on the basis of qualitative (mainly topological) as well as basic quantitative information (lower-bounds on the matrix entries). The results appear to be tight in a number of instances and are illustrated through simple as well as more sophisticated examples. The main idea is to follow propagation of information along certain spanning trees which arise in the communication graph.
27 pages, 5 figures

Keywords

Optimization and Control, 93C05; 05C50; 05C90; 93C55; 93D20; 98R10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/144694

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0610854
 http://arxiv.org/abs/math/0610854

Collections

arXiv