Hostname: page-component-74656f9884-g96k6 Total loading time: 0 Render date: 2026-11-11T01:08:47.278Z Has data issue: false hasContentIssue false

An Efficient Procedure for Computing Quasi-Stationary Distributions of Markov Chains by Sparse Transition Structure

Published online by Cambridge University Press:  01 July 2016

P. K. Pollett*
Affiliation:
The University of Queensland
D. E. Stewart*
Affiliation:
The Australian National University
*
* Postal address: Department of Mathematics, The University of Queensland, QLD 4072, Australia.
** Postal address: Programme in Advanced Computation, School of Mathematical Sciences, The Australian National University, Canberra, ACT 2601, Australia.

Abstract

We describe a computational procedure for evaluating the quasi-stationary distributions of a continuous-time Markov chain. Our method, which is an ‘iterative version' of Arnoldi's algorithm, is appropriate for dealing with cases where the matrix of transition rates is large and sparse, but does not exhibit a banded structure which might otherwise be usefully exploited. We illustrate the method with reference to an epidemic model and we compare the computed quasi-stationary distribution with an appropriate diffusion approximation.

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 1994 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable