IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v52y2023i4p973-987.html
   My bibliography  Save this article

On the use of Cauchy integral formula for the embedding problem of discrete-time Markov chains

Author

Listed:
  • Virtue U. Ekhosuehi

Abstract

In manpower planning there is an interesting, practically important and open challenging issue arising from the instances where a transition matrix over a certain short time interval is required but only a transition matrix over a longer time interval may be available. For example, the problem of finding a meaningful p−th root of an observable stochastic matrix within the context of Markov chains. The more general problem is divided into three phases, viz. embeddability, inverse, and identification problems. By exploiting the Cauchy’s integral formula with the integrand defined on the Runnenberg’s heart-shaped region, a new representation for a stochastic matrix that is embeddable is derived. New conditions for embeddability and regularization of stochastic matrices are provided. Examples are presented to illustrate the utility of the Cauchy’s representation formula and its consequences.

Suggested Citation

  • Virtue U. Ekhosuehi, 2023. "On the use of Cauchy integral formula for the embedding problem of discrete-time Markov chains," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(4), pages 973-987, February.
    • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:4:p:973-987
    DOI: 10.1080/03610926.2021.1921806
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2021.1921806
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2021.1921806?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:taf:lstaxx:v:52:y:2023:i:4:p:973-987. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.