TY - GEN
T1 - Necessary and sufficient conditions for consensus over random independent and identically distributed switching graphs
AU - Tahbaz-Salehi, Alireza
AU - Jadbabaie, Ali
PY - 2007
Y1 - 2007
N2 - In this paper we consider the consensus problem for stochastic switched linear dynamical systems. For discrete-time and continuous-time stochastic switched linear systems, we present necessary and sufficient conditions under which such systems reach a consensus almost surely. In the discrete-time case, our assumption is that the underlying graph of the system at any given time instance is derived from a random graph process, independent of other time instances. These graphs can be weighted, directed and with dependent edges. For the continuous-time case, we assume that the switching is governed by a Poisson point process and the graphs characterizing the topology of the system are independent and identically distributed over time. For both such frameworks, we present necessary and sufficient conditions for almost sure asymptotic consensus using simple ergodicity and probabilistic arguments. These easily verifiable conditions depend on the spectrum of the average weight matrix and the average Laplacian matrix for the discrete-time and continuous-time cases, respectively.
AB - In this paper we consider the consensus problem for stochastic switched linear dynamical systems. For discrete-time and continuous-time stochastic switched linear systems, we present necessary and sufficient conditions under which such systems reach a consensus almost surely. In the discrete-time case, our assumption is that the underlying graph of the system at any given time instance is derived from a random graph process, independent of other time instances. These graphs can be weighted, directed and with dependent edges. For the continuous-time case, we assume that the switching is governed by a Poisson point process and the graphs characterizing the topology of the system are independent and identically distributed over time. For both such frameworks, we present necessary and sufficient conditions for almost sure asymptotic consensus using simple ergodicity and probabilistic arguments. These easily verifiable conditions depend on the spectrum of the average weight matrix and the average Laplacian matrix for the discrete-time and continuous-time cases, respectively.
UR - http://www.scopus.com/inward/record.url?scp=62749187756&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=62749187756&partnerID=8YFLogxK
U2 - 10.1109/CDC.2007.4434408
DO - 10.1109/CDC.2007.4434408
M3 - Conference contribution
AN - SCOPUS:62749187756
SN - 1424414989
SN - 9781424414987
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 4209
EP - 4214
BT - Proceedings of the 46th IEEE Conference on Decision and Control 2007, CDC
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 46th IEEE Conference on Decision and Control 2007, CDC
Y2 - 12 December 2007 through 14 December 2007
ER -