Abstract

This paper considers consensus problems with random networks. A key object of our analysis is a sequence of stochastic matrices which involve Markovian switches and decreasing step sizes. We establish ergodicity of the backward products of these stochastic matrices. The basic technique is to consider the second moment dynamics of an associated Markovian jump linear system and exploit its two-scale interaction property resulting from the decreasing step sizes. The mean square convergence rate of the backward products is also obtained. The ergodicity results are used to prove mean square consensus of stochastic approximation algorithms where agents collect noisy information. The approach is further applied to a token scheduled averaging model.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.