IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v50y2025i1p334-355.html
   My bibliography  Save this article

Strongly Convergent Homogeneous Approximations to Inhomogeneous Markov Jump Processes and Applications

Author

Listed:
  • Martin Bladt

    (Faculty of Mathematical Sciences, University of Copenhagen, 2100 Copenhagen, Denmark)

  • Oscar Peralta

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853)

Abstract

The study of time-inhomogeneous Markov jump processes is a traditional topic within probability theory that has recently attracted substantial attention in various applications. However, their flexibility also incurs a substantial mathematical burden which is usually circumvented by using well-known generic distributional approximations or simulations. This article provides a novel approximation method that tailors the dynamics of a time-homogeneous Markov jump process to meet those of its time-inhomogeneous counterpart on an increasingly fine Poisson grid. Strong convergence of the processes in terms of the Skorokhod J 1 metric is established, and convergence rates are provided. Under traditional regularity assumptions, distributional convergence is established for unconditional proxies, to the same limit. Special attention is devoted to the case where the target process has one absorbing state and the remaining ones transient, for which the absorption times also converge. Some applications are outlined, such as univariate hazard-rate density estimation, ruin probabilities, and multivariate phase-type density evaluation.

Suggested Citation

  • Martin Bladt & Oscar Peralta, 2025. "Strongly Convergent Homogeneous Approximations to Inhomogeneous Markov Jump Processes and Applications," Mathematics of Operations Research, INFORMS, vol. 50(1), pages 334-355, February.
  • Handle: RePEc:inm:ormoor:v:50:y:2025:i:1:p:334-355
    DOI: 10.1287/moor.2022.0153
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.0153
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2022.0153?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
    ---><---

    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:inm:ormoor:v:50:y:2025:i:1:p:334-355. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.