Hostname: page-component-74656f9884-g96k6 Total loading time: 0 Render date: 2026-11-10T12:03:53.361Z Has data issue: false hasContentIssue false

The inverse problem in reducible Markov chains

Published online by Cambridge University Press:  14 July 2016

W. D. Ray
Affiliation:
Birkbeck College London
F. Margo
Affiliation:
Albright and Wilson Ltd., London

Abstract

The equilibrium probability distribution over the set of absorbing states of a reducible Markov chain is specified a priori and it is required to obtain the constrained sub-space or feasible region for all possible initial probability distributions over the set of transient states. This is called the inverse problem. It is shown that a feasible region exists for the choice of equilibrium distribution. Two different cases are studied: Case I, where the number of transient states exceeds that of the absorbing states and Case II, the converse. The approach is via the use of generalised inverses and numerical examples are given.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1976 

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