Abstract
This technical note presents a convergence criterion for infinite products of stochastic matrices which is based on graphical decomposition of the associated graphs. We show that if the associated graphs of a set of stochastic matrices share a common graphical decomposition and the corresponding reduced graphs are rooted, then any infinite products of the given set of stochastic matrices is convergent. Specifically, we propose a numerical algorithm for finding the common graphical decomposition of the associated graphs, which has been proved to be polynomial-time fast. The proposed criterion can be applied directly to a series of classical results in distributed coordination algorithm.
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 callDisclaimer: 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.
