IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v37y2024i2d10.1007_s10959-024-01322-8.html
   My bibliography  Save this article

Exit Times for a Discrete Markov Additive Process

Author

Listed:
  • Zbigniew Palmowski

    (Wrocław University of Science and Technology)

  • Lewis Ramsden

    (University of York)

  • Apostolos D. Papaioannou

    (University of Liverpool)

Abstract

In this paper, we consider (upward skip-free) discrete-time and discrete-space Markov additive chains (MACs) and develop the theory for the so-called $$\widetilde{{\textbf {W}}}$$ W ~ and $$\widetilde{{\textbf {Z}}}$$ Z ~ scale matrices, which are shown to play a vital role in the determination of a number of exit problems and related fluctuation identities. The theory developed in this fully discrete set-up follows similar lines of reasoning as the analogous theory for Markov additive processes in continuous time and is exploited to obtain the probabilistic construction of the scale matrices, identify the form of the generating function and produce a simple recursion relation for $$\widetilde{{\textbf {W}}}$$ W ~ , as well as its connection with the so-called occupation mass formula. In addition to the standard one- and two-sided exit problems (upwards and downwards), we also derive distributional characteristics for a number of quantities related to the one- and two-sided ‘reflected’ processes.

Suggested Citation

  • Zbigniew Palmowski & Lewis Ramsden & Apostolos D. Papaioannou, 2024. "Exit Times for a Discrete Markov Additive Process," Journal of Theoretical Probability, Springer, vol. 37(2), pages 1052-1078, June.
    • Handle: RePEc:spr:jotpro:v:37:y:2024:i:2:d:10.1007_s10959-024-01322-8
    DOI: 10.1007/s10959-024-01322-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-024-01322-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-024-01322-8?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.

    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:spr:jotpro:v:37:y:2024:i:2:d:10.1007_s10959-024-01322-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.