Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Recently, methods in stochastic control are used to study the synchronization properties of a nonautonomous discrete-time linear system x(k + 1) = G(k)x(k) where the matrices G(k) are derived from a random graph process. The purpose of this note is to extend this analysis to directed graphs and more general random graph processes. Rather than using Lyapunov type methods, we use results from the theory of inhomogeneous Markov chains in our analysis. These results have been used successfully in deterministic consensus problems and we show that they are useful for these problems as well. Sufficient conditions are derived that depend on the types of graphs that have nonvanishing probabilities. For instance, if a scrambling graph occurs with nonzero probability, then the system synchronizes. © 2006 IEEE.
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008