A Computational Framework for the Mixing Times in the QBD Processes with Infinitely-Many Levels

preprint2013arXivOpen access

Abstract

In this paper, we develop some matrix Poisson's equations satisfied by the mean and variance of the mixing time in an irreducible positive-recurrent discrete-time Markov chain with infinitely-many levels, and provide a computational framework for the solution to the matrix Poisson's equations by means of the UL-type of RGRG-factorization as well as the generalized inverses. In an important special case: the level-dependent QBD processes, we provide a detailed computation for the mean and variance of the mixing time. Based on this, we give new highlight on computation of the mixing time in the block-structured Markov chains with infinitely-many levels through the matrix-analytic method.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.