Convergence rates of discrete-time stochastic approximation consensus algorithms: Graph-related limit bounds

摘要

In this paper, we study the convergence rates of the discrete-time stochastic approximation consensus algorithms over sensor networks with communication noises under general digraphs. Basic results of stochastic analysis and algebraic graph theory are used to investigate the dynamics of the consensus error, and the mean square and sample path convergence rates of the consensus error are both given in terms of the graph and noise parameters. Especially, calculation methods to estimate the mean square limit bounds are presented under balanced digraphs, and sufficient conditions on the network topology and the step sizes are given to achieve the fast convergence rate. For the sample path limit bounds, estimation methods are also presented under undirected graphs. (C) 2017 Elsevier B.V. All rights reserved.