Probabilistic Switching and Convergence Rate in Consensus Problems

Probabilistic Switching and Convergence Rate in Consensus Problems

Title : Probabilistic Switching and Convergence Rate in Consensus Problems
Authors :
Baras, John S.
Gupta, Vijay
Hovareshti, Pedram
Conference : 45th Annual Allerton Conference pp. 423-430
Date: September 26 - September 28, 2007

We consider the convergence problem of consensus seeking agents and the effect of probabilistic switching on the convergence rate. Using a probabilistic setting, we develop a framework to study the convergence rate for different classes of graph topologies, including Small World networks. We show that by making the effective diameter of the underlying graph small, probabilistic switching can be helpful in the design of fast consensus algorithms.

Download Full Paper