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

A finite characterization of weak lumpable Markov processes. Part II: The continuous time case

Author

Listed:
  • Rubino, Gerardo
  • Sericola, Bruno

Abstract

We analysed in the companion paper (Stochastic Process. Appl. 38, 1991), the conditions under which the aggregated process constructed from an irreducible and homogeneous discrete time Markov chain over a given partition of its state space is another homogeneous Markov chain. The obtained result is a characterization of this situation by means of a finite algorithm which computes the set of all the initial probability distributions of the starting chain such that the aggregated one is also Markov homogeneous. In this paper, we consider the same problem in continuous time. Our main result is that it is always possible to come back to the discrete time case using uniformization.

Suggested Citation

  • Rubino, Gerardo & Sericola, Bruno, 1993. "A finite characterization of weak lumpable Markov processes. Part II: The continuous time case," Stochastic Processes and their Applications, Elsevier, vol. 45(1), pages 115-125, March.
  • Handle: RePEc:eee:spapps:v:45:y:1993:i:1:p:115-125
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(93)90063-A
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Spreij, Peter, 2001. "On the Markov property of a finite hidden Markov chain," Statistics & Probability Letters, Elsevier, vol. 52(3), pages 279-288, April.
    2. Ledoux, James, 1995. "On weak lumpability of denumerable Markov chains," Statistics & Probability Letters, Elsevier, vol. 25(4), pages 329-339, December.

    More about this item

    Statistics

    Access and download statistics

    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:45:y:1993:i:1:p:115-125. 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.