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

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

2006-10-27

arxiv.org/abs/math/0610854v2

Mathematics

Optimization and Control

27 pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Convergence speed of unsteady distributed consensus: decay estimate along the settling spanning-trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convergence speed of unsteady distributed consensus: decay estimate along the settling spanning-trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence speed of unsteady distributed consensus: decay estimate along the settling spanning-trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-169740