IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v7y1978i3p277-290.html
   My bibliography  Save this article

Markov chains and processes with a prescribed invariant measure

Author

Listed:
  • Karr, Alan F.

Abstract

Let (E, ) be a measurable space and let [eta] be a probability measure on . Denote by I([eta]) the set of Markov kernels P over (E, ) for which [eta] is an invariant measure: [eta] = [eta]P. We characterize the extreme points of I([eta]) in this paper. When E is a finite set, I([eta]) is a compact, convex set of Markov matrices over E and our characterization generalizes the Birkhoff-von Neumann theorem, which asserts that if [eta] is the uniform distribution on E the extreme points of I([eta]) are the (# E)! permutation matrices. The number of extreme points of I([eta]) depends in a complicated manner on the entries of [eta]; the case # F = 3 is enumerated explicitly and general results are given on the maximum and minimum numbers of extreme points. For finite E a similar treatment is given of the convex cone I*([eta]) of all generator matrices of Markov processes for which [eta] is invariant: its extremal rays are identified.

Suggested Citation

  • Karr, Alan F., 1978. "Markov chains and processes with a prescribed invariant measure," Stochastic Processes and their Applications, Elsevier, vol. 7(3), pages 277-290, August.
  • Handle: RePEc:eee:spapps:v:7:y:1978:i:3:p:277-290
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(78)90047-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:7:y:1978:i:3:p:277-290. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.