Ergodicity and Class-Ergodicity of Balanced Asymmetric Stochastic Chains


BibTeX reference

Unconditional consensus is the property of a consensus algorithm for multiple agents, to produce consensus irrespective of the particular time or state at which the agent states are initialized. Under a weak condition, so-called balanced asymmetry, on the sequence (At ) of stochastic matrices in the agents states update algorithm, it is shown that (i) the set of accumulation points of states as t grows large is finite, (ii) the asymptotic unconditional occurrence of single consensus or multiple consensuses is directly related to the property of absolute infinite flow of this sequence, as introduced by Touri and Nedic. The latter condition must be satisfied on each of the islands of the so-called unbounded interactions graph induced by (At ), defined by Hendricks et al.

, 15 pages

This cahier was revised in September 2013


Ergodicity and class-ergodicity of balanced asymmetric stochastic chains
Proceedings of European Control Conference, Zurich, Switzerland, 17-19 juillet 2013, 221–226, 2013 BibTeX reference