Continuous-time block-monotone Markov chains and their block-augmented truncations

From MaRDI portal
Publication:347491

DOI10.1016/J.LAA.2016.10.014zbMATH Open1349.60127arXiv1511.04669OpenAlexW2268727185MaRDI QIDQ347491FDOQ347491

Hiroyuki Masuyama

Publication date: 30 November 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: This paper considers continuous-time block-monotone Markov chains (BMMCs) and their block-augmented truncations. We first introduce the block monotonicity and block-wise dominance relation for continuous-time Markov chains, and then provide some fundamental results on the two notions. Using these results, we show that the stationary distribution vectors obtained by the block-augmented truncation converge to the stationary distribution vector of the original BMMC. We also show that the last-column-block-augmented truncation (LC-block-augmented truncation) provides the best (in a certain sense) approximation to the stationary distribution vector of a BMMC among all the block-augmented truncations. Furthermore, we present computable upper bounds for the total variation distance between the stationary distribution vectors of a Markov chain and its LC-block-augmented truncation, under the assumption that the original Markov chain itself may not be block-monotone but is block-wise dominated by a BMMC with exponential ergodicity. Finally, we apply the obtained bounds to a queue with a batch Markovian arrival process and state-dependent departure rates.


Full work available at URL: https://arxiv.org/abs/1511.04669




Recommendations




Cites Work


Cited In (10)

Uses Software





This page was built for publication: Continuous-time block-monotone Markov chains and their block-augmented truncations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347491)