On approximations and ergodicity classes in random chains

Behrouz Touri, Angelia Nedich

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

We study the limiting behavior of a random dynamic system driven by a stochastic chain. Our interest is in the chains that are not necessarily ergodic but are decomposable into ergodic classes. To investigate the conditions under which the ergodic classes of a model can be identified, we introduce and study an ℓ1-approximation and infinite flow graph of the model. We show that the ℓ1-approximations of random chains preserve certain limiting behavior. Using the ℓ1-approximations, we show how the connectivity of the infinite flow graph is related to the structure of the ergodic groups of the model. Our main result of this paper provides conditions under which the ergodicity groups of the model can be identified by considering the connected components in the infinite flow graph. We provide two applications of our main result to random networks, namely broadcast over time-varying networks and networks with random link failure.

Original languageEnglish (US)
Article number6170548
Pages (from-to)2718-2730
Number of pages13
JournalIEEE Transactions on Automatic Control
Volume57
Issue number11
DOIs
StatePublished - 2012
Externally publishedYes

Fingerprint

Flow graphs
Time varying networks
Dynamical systems

Keywords

  • Ergodicity
  • ergodicity classes
  • infinite flow
  • product of random matrices

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Computer Science Applications

Cite this

On approximations and ergodicity classes in random chains. / Touri, Behrouz; Nedich, Angelia.

In: IEEE Transactions on Automatic Control, Vol. 57, No. 11, 6170548, 2012, p. 2718-2730.

Research output: Contribution to journalArticle

@article{e55f3aaa8ac3497fb2b6a47b76882298,
title = "On approximations and ergodicity classes in random chains",
abstract = "We study the limiting behavior of a random dynamic system driven by a stochastic chain. Our interest is in the chains that are not necessarily ergodic but are decomposable into ergodic classes. To investigate the conditions under which the ergodic classes of a model can be identified, we introduce and study an ℓ1-approximation and infinite flow graph of the model. We show that the ℓ1-approximations of random chains preserve certain limiting behavior. Using the ℓ1-approximations, we show how the connectivity of the infinite flow graph is related to the structure of the ergodic groups of the model. Our main result of this paper provides conditions under which the ergodicity groups of the model can be identified by considering the connected components in the infinite flow graph. We provide two applications of our main result to random networks, namely broadcast over time-varying networks and networks with random link failure.",
keywords = "Ergodicity, ergodicity classes, infinite flow, product of random matrices",
author = "Behrouz Touri and Angelia Nedich",
year = "2012",
doi = "10.1109/TAC.2012.2191178",
language = "English (US)",
volume = "57",
pages = "2718--2730",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - On approximations and ergodicity classes in random chains

AU - Touri, Behrouz

AU - Nedich, Angelia

PY - 2012

Y1 - 2012

N2 - We study the limiting behavior of a random dynamic system driven by a stochastic chain. Our interest is in the chains that are not necessarily ergodic but are decomposable into ergodic classes. To investigate the conditions under which the ergodic classes of a model can be identified, we introduce and study an ℓ1-approximation and infinite flow graph of the model. We show that the ℓ1-approximations of random chains preserve certain limiting behavior. Using the ℓ1-approximations, we show how the connectivity of the infinite flow graph is related to the structure of the ergodic groups of the model. Our main result of this paper provides conditions under which the ergodicity groups of the model can be identified by considering the connected components in the infinite flow graph. We provide two applications of our main result to random networks, namely broadcast over time-varying networks and networks with random link failure.

AB - We study the limiting behavior of a random dynamic system driven by a stochastic chain. Our interest is in the chains that are not necessarily ergodic but are decomposable into ergodic classes. To investigate the conditions under which the ergodic classes of a model can be identified, we introduce and study an ℓ1-approximation and infinite flow graph of the model. We show that the ℓ1-approximations of random chains preserve certain limiting behavior. Using the ℓ1-approximations, we show how the connectivity of the infinite flow graph is related to the structure of the ergodic groups of the model. Our main result of this paper provides conditions under which the ergodicity groups of the model can be identified by considering the connected components in the infinite flow graph. We provide two applications of our main result to random networks, namely broadcast over time-varying networks and networks with random link failure.

KW - Ergodicity

KW - ergodicity classes

KW - infinite flow

KW - product of random matrices

UR - http://www.scopus.com/inward/record.url?scp=84869432196&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84869432196&partnerID=8YFLogxK

U2 - 10.1109/TAC.2012.2191178

DO - 10.1109/TAC.2012.2191178

M3 - Article

AN - SCOPUS:84869432196

VL - 57

SP - 2718

EP - 2730

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 11

M1 - 6170548

ER -