Consensus over a Random Network Generated by i.i.d. Stochastic Matrices
Abstract
Our goal is to find a necessary and sufficient condition on the consensus over a random network, generated by i.i.d. stochastic matrices. We show that the consensus problem in three different convergence modes (almost surely, in probability, and in L1) are equivalent, thus have the same necessary and sufficient condition. We obtain the necessary and sufficient condition through the stability in a projected subspace.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.