IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v26y2024i4d10.1007_s11009-024-10127-5.html
   My bibliography  Save this article

On the Longest Run and the Waiting Time for the First Run in a Continuous Time Multi-State Markov Chain

Author

Listed:
  • Eutichia Vaggelatou

    (National and Kapodistrian University of Athens)

Abstract

In this paper, a marked point process with $$r+1$$ r + 1 types of marks (r types of successes $$S_{1},S_{2},\ldots ,S_{r}$$ S 1 , S 2 , … , S r and a failure F), $$r\ge 1$$ r ≥ 1 , that appear in continuous time according to a continuous-time Markov chain is considered. By constructing an appropriate embedded process using Markov chain embedding technique in continuous time, the exact distribution and its Laplace transform for the waiting time T until the first appearance of an $$S_{i}$$ S i -run of length $$k_{i}$$ k i , for $$i=1,2,\ldots ,r$$ i = 1 , 2 , … , r (whichever comes first), are provided. The exact distribution of the length $$L_{t}$$ L t of the longest run of successes in the time interval [0, t] is also derived. Further, the asymptotic distributions of T and $$L_{t}$$ L t are obtained under general assumptions. Finally, numerical examples and applications in reliability theory, quality control and hypothesis testing are presented.

Suggested Citation

  • Eutichia Vaggelatou, 2024. "On the Longest Run and the Waiting Time for the First Run in a Continuous Time Multi-State Markov Chain," Methodology and Computing in Applied Probability, Springer, vol. 26(4), pages 1-26, December.
    • Handle: RePEc:spr:metcap:v:26:y:2024:i:4:d:10.1007_s11009-024-10127-5
    DOI: 10.1007/s11009-024-10127-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-024-10127-5
    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/s11009-024-10127-5?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:metcap:v:26:y:2024:i:4:d:10.1007_s11009-024-10127-5. 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.