A Lower Bound on Convergence of a Distributed Network Consensus Algorithm

This paper gives a lower bound on the convergence rate of a class of network consensus algorithms. Two different approaches using directed graphs as a main tool are introduced: one is to compute the "scrambling constants" of stochastic matrices associated with "neighbor shared graphs" and the other is to analyze random walks on a sequence of graphs. Both approaches prove that the time to reach consensus within a dynamic network is logarithmic in the relative error and is in worst case exponential in the size of the network.

[1]  J. Doob.  Stochastic processes , 1953 .

[2]  M. Bartlett,et al.  Weak ergodicity in non-homogeneous Markov chains , 1958, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[4]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[5]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[6]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[7]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[8]  C. Tan.  On the weak ergodicity of nonhomogeneous Markov chains , 1996 .

[9]  Kevin M. Passino,et al.  Stability analysis of swarms , 2003, IEEE Trans. Autom. Control..

[10]  Jie Lin,et al.  The multi-agent rendezvous problem , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[11]  Luc Moreau,et al.  Leaderless coordination via bidirectional and unidirectional time-dependent communication , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[12]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[13]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[14]  F. Bullo,et al.  ON ROBUST RENDEZVOUS FOR MOBILE AUTONOMOUS AGENTS , 2005 .

[15]  Ming Cao,et al.  COORDINATION OF AN ASYNCHRONOUS MULTI-AGENT SYSTEM VIA AVERAGING , 2005 .

[16]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .