Waiting time problems for patterns in a sequence of multi-state trials

Bara Kim, Jeongsim Kim, Jerim Kim

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In this paper, we investigate waiting time problems for a finite collection of patterns in a sequence of independent multi-state trials. By constructing a finite GI/M/1-type Markov chain with a disaster and then using the matrix analytic method, we can obtain the probability generating function of the waiting time. From this, we can obtain the stopping probabilities and the mean waiting time, but it also enables us to compute the waiting time distribution by a numerical inversion.

Original languageEnglish
Article number1893
Pages (from-to)1-16
Number of pages16
JournalMathematics
Volume8
Issue number11
DOIs
Publication statusPublished - 2020 Nov

Bibliographical note

Funding Information:
Funding: The first author’s research was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. 2020R1A2B5B01001864). The second author’s research was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. 2020R1F1A1A01065568).

Publisher Copyright:
© 2020 by the authors. Licensee MDPI, Basel, Switzerland.

Keywords

  • Matrix analytic method
  • Pattern
  • Sooner waiting time
  • Stopping probability

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Waiting time problems for patterns in a sequence of multi-state trials'. Together they form a unique fingerprint.

Cite this