IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i5p660-d1344988.html
   My bibliography  Save this article

Strong Ergodicity in Nonhomogeneous Markov Systems with Chronological Order

Author

Listed:
  • P.-C.G. Vassiliou

    (Department of Statistical Sciences, University College London, Gower St., London WC1E 6BT, UK)

Abstract

In the present, we study the problem of strong ergodicity in nonhomogeneous Markov systems. In the first basic theorem, we relax the fundamental assumption present in all studies of asymptotic behavior. That is, the assumption that the inherent inhomogeneous Markov chain converges to a homogeneous Markov chain with a regular transition probability matrix. In addition, we study the practically important problem of the rate of convergence to strong ergodicity for a nonhomogeneous Markov system (NHMS). In a second basic theorem, we provide conditions under which the rate of convergence to strong ergodicity is geometric. With these conditions, we in fact relax the basic assumption present in all previous studies, that is, that the inherent inhomogeneous Markov chain converges to a homogeneous Markov chain with a regular transition probability matrix geometrically fast. Finally, we provide an illustrative application from the area of manpower planning.

Suggested Citation

  • P.-C.G. Vassiliou, 2024. "Strong Ergodicity in Nonhomogeneous Markov Systems with Chronological Order," Mathematics, MDPI, vol. 12(5), pages 1-16, February.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:5:p:660-:d:1344988
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/5/660/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/5/660/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:12:y:2024:i:5:p:660-:d:1344988. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.