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

Simple item page
dc.creatorAngeli, David
dc.creatorBliman, Pierre-Alexandre
dc.date2006-10-27
dc.date2007-12-22
dc.date.accessioned2026-07-07T08:50:43Z
dc.date.available2026-07-07T08:50:43Z
dc.descriptionResults 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.
dc.description27 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/math/0610854
dc.identifierhttp://arxiv.org/abs/math/0610854
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144694
dc.subjectOptimization and Control
dc.subject93C05; 05C50; 05C90; 93C55; 93D20; 98R10
dc.titleConvergence speed of unsteady distributed consensus: decay estimate along the settling spanning-trees
dc.typetext

Files

Collections

arXiv