Abstract
In this work, we consider the problem of distributed consensus when some agents in the network are faulty and communication among agents happen over a random sequence of time-varying graphs. Agents iteratively communicate with their neighbors to achieve the consensus. We extend the network robustness condition presented in existing works on static (or time-varying but not random) graphs to the situation when communication graphs are derived from some probability distribution thus essentially random. We show that if the sequence of random graphs is uniformly stochastically robust, then the consensus can be achieved almost surely by all non-faulty agents.
Sign-in/Register to access full text options 
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.
