Skip to main content

Part of the book series: Statistics for Industry and Technology ((SIT))

Abstract

Let X 0, X 1, X 2,… be a sequence of {0, 1}-valued Markov chain. Let E 1 denote a run of “1” of length k and E 0 denote a run of “0” of length r. We observe which run comes sooner or later in the sequence X 0, X 1, X 2, …. The exact distributions of the numbers of overlapping sooner runs and nonoverlapping sooner runs until the later run occurs (for the first time) are derived. Let F 1 be a success run of length k or more and let F 0 be a failure run of length r or more. The exact distribution of the number of occurrences of the sooner event until the first occurrence of the later event between F 1 and F 0 is also studied. Further, when X’s have more than two values, more general problems are discussed and the exact joint distribution of the numbers of occurrences of the first, the second,…, and the j-th runs until the j-th run occurs (for the first time) is obtained in the case of independent trials.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aki, S. (1992). Waiting time problems for a sequence of discrete random variables, Annals of the Institute of Statistical Mathematics, 44, 363–378.

    Article  MathSciNet  MATH  Google Scholar 

  2. Aki, S., Balakrishnan, N. and Mohanty, S. G. (1996). Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials, Annals of the Institute of Statistical Mathematics, 48, 773–787.

    Article  MathSciNet  MATH  Google Scholar 

  3. Aki, S. and Hirano, K. (1993). Discrete distributions related to succession events in a two-state Markov chain, In Statistical Science & Data Analysis (Eds., K. Matusita, M. L. Puri and T. Hayakawa), pp. 467–474, Utrecht: VSP Publishers.

    Google Scholar 

  4. Aki, S. and Hirano, K. (1994). Distributions of numbers of failures and successes until the first consecutive k successes, Annals of the Institute of Statistical Mathematics, 46, 193–202.

    Article  MathSciNet  MATH  Google Scholar 

  5. Balasubramanian, K., Viveros, R. and Balakrishnan, N. (1993). Sooner and later waiting time problems for Markovian Bernoulli trials, Statistics & Probability Letters, 18, 153–161.

    Article  MathSciNet  MATH  Google Scholar 

  6. Ebneshahrashoob, M. and Sobel, M. (1990). Sooner and later problems for Bernoulli trials: frequency and run quotas, Statistics & Probability Letters, 9, 5–11.

    Article  MathSciNet  MATH  Google Scholar 

  7. Fu, J. C. and Koutras, M. V. (1994). Distribution theory of runs: A Markov chain approach, Journal of the American Statistical Association, 89, 1050–1058.

    Article  MathSciNet  MATH  Google Scholar 

  8. Goldstein, L. (1990). Poisson approximation and DNA sequence matching, Communications in Statistics-Theory and Methods, 19, 4167–4179.

    Article  MathSciNet  MATH  Google Scholar 

  9. Hirano, K. and Aki, S. (1993). On number of occurrences of success runs of specified length in a two-state Markov chain, Statistica Sinica, 3, 313–320.

    MathSciNet  MATH  Google Scholar 

  10. Mohanty, S. G. (1994). Success runs of length k in Markov dependent trials, Annals of the Institute of Statistical Mathematics, 46, 777–796.

    Article  MathSciNet  MATH  Google Scholar 

  11. Uchida, M. and Aki, S. (1995). Sooner and later waiting time problems in a two-state Markov chain, Annals of the Institute of Statistical Mathematics, 47, 415–433

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Birkhäuser Boston

About this chapter

Cite this chapter

Aki, S. (1997). On Sooner and Later Problems Between Success and Failure Runs. In: Balakrishnan, N. (eds) Advances in Combinatorial Methods and Applications to Probability and Statistics. Statistics for Industry and Technology. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4140-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4140-9_22

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-1-4612-8671-4

  • Online ISBN: 978-1-4612-4140-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics