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.
Convergence speed of distributed consensus and topology of the associated information spread / Angeli, David; Bliman, Pierre-Alexandre. - CD-ROM. - (2007), pp. 497-502. (Intervento presentato al convegno IEEE Conference on Decision and Control).
Convergence speed of distributed consensus and topology of the associated information spread
Angeli, David;
2007
Abstract
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.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
