Products of stochastic matrices: Exact rate for convergence in probability for directed networks

Dragana Bajovic, Joao Xavier, Bruno Sinopoli

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We study the products Wk···W1 of random stochastic, not necessarily symmetric matrices. It is known that, under certain conditions, the product Wk ⋯ W1 converges almost surely (a.s.) to a random rank-one matrix; the latter is equivalent to |λ2(Wk ⋯ W1)| → 0 a.s., where λ2(·) is the second largest (in modulus) eigenvalue. In this paper, we show that the probability that |λ2(Wk ⋯ W1)| stays above ε ∈ (0,1] in the long run decays to zero exponentially fast ∼ e -kI. Furthermore, we explicitly characterize the rate of this convergence I and show that it depends only on the underlying graphs that support the matrices Wk's. Our results reveal that the rate I is essentially determined by the most likely way in which the union (over time) of the support graphs fails to form a directed tree.

Original languageEnglish
Title of host publication2012 20th Telecommunications Forum, TELFOR 2012 - Proceedings
Pages883-886
Number of pages4
DOIs
StatePublished - 2012
Event2012 20th Telecommunications Forum, TELFOR 2012 - Belgrade, Serbia
Duration: Nov 20 2012Nov 22 2012

Publication series

Name2012 20th Telecommunications Forum, TELFOR 2012 - Proceedings

Conference

Conference2012 20th Telecommunications Forum, TELFOR 2012
Country/TerritorySerbia
CityBelgrade
Period11/20/1211/22/12

Keywords

  • Consensus
  • Convergence in probability
  • Directed networks
  • Exponential rate
  • Stochastic matrices

Fingerprint

Dive into the research topics of 'Products of stochastic matrices: Exact rate for convergence in probability for directed networks'. Together they form a unique fingerprint.

Cite this