By Topic

Products of stochastic matrices: Large deviation rate for Markov chain temporal dependencies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bajovic, D. ; Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA ; Xavier, J. ; Sinopoli, B.

We find the large deviation rate I for convergence in probability of the product Wk ---W1W0 of temporally dependent random stochastic matrices. As the model for temporal dependencies, we adopt the Markov chain whose set of states is the set of all possible graphs that support the matrices Wk. Such model includes, for example, 1) token-based protocols, where a token is passed among nodes to determine the order of processing; and 2) temporally dependent link failures, where the temporal dependence is modeled by a Markov chain. We characterize the rate I as a function of the Markov chain transition probability matrix P. Examples further reveal how the temporal correlations (dependencies) affect the rate of convergence in probability I.

Published in:

Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on

Date of Conference:

1-5 Oct. 2012