Skip to main content Accessibility help
×
Home

On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials

  • Kiyoshi Inoue (a1) and Sigeo Aki (a2)

Abstract

In this paper we study two distributions, namely the distribution of the waiting times until given numbers of occurrences of compound patterns and the distribution of the numbers of occurrences of compound patterns in a fixed number of trials. We elucidate the interrelation between these two distributions in terms of the generating functions. We provide perspectives on the problems related to compound patterns in statistics and probability. As an application, the waiting time problem of counting runs of specified lengths is considered in order to illustrate how the distributions of waiting times can be derived from our theoretical results.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials
      Available formats
      ×

Copyright

Corresponding author

Postal address: Faculty of Economics, Seikei University, 3-3-1 Kichijoji-Kitamachi, Musasino-shi, Tokyo, 180-8633, Japan. Email address: kinoue@econ.seikei.ac.jp
∗∗ Postal address: Department of Mathematics, Faculty of Engineering, Kansai University, 3-3-35 Yamate-cho, Suita-shi, Osaka, 564-8680, Japan.

References

Hide All
Adler, I. and Ross, S. (2001). The coupon subset collection problem. J. Appl. Prob. 38, 737746.
Aki, S. and Hirano, K. (1993). Discrete distributions related to succession events in a two-state Markov chain. In Statistical Sciences and Data Analysis (Proc. Third Pacific Area Statist. Conf.), eds Matusita, K., Puri, M. L. and Hayakawa, T., VSP International Science Publishers, Zeist, pp. 467474.
Aki, S. and Hirano, K. (2000). Numbers of success-runs of specified length until certain stopping time rules and generalized binomial distributions of order k. Ann. Inst. Statist. Math. 52, 767777.
Aki, S., Balakrishnan, N. and Mohanty, S. G. (1996). Sooner and later waiting time problems and failure runs in higher order Markov dependent trials. Ann. Inst. Statist. Math. 48, 773787.
Balakrishnan, N. and Koutras, M. V. (2002). Runs and Scans with Applications. John Wiley, New York.
Balakrishnan, N., Mohanty, S. G. and Aki, S. (1997). Start-up demonstration tests under Markov dependence model with corrective actions. Ann. Inst. Statist. Math. 49, 155169.
Ebneshahrashoob, M. and Sobel, M. (1990). Sooner and later waiting time problems for Bernoulli trials: frequency and run quotas. Statist. Prob. Lett. 9, 511.
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. I, 3rd edn. John Wiley, New York.
Fu, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statistica Sinica 6, 957974.
Fu, J. C. and Chang, Y. M. (2002). On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials. J. Appl. Prob. 39, 7080.
Fu, J. C. and Chang, Y. M. (2003). On ordered series and later waiting time distributions in a sequence of Markov dependent multistate trials. J. Appl. Prob. 40, 623642.
Fu, J. C. and Koutras, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 10501058.
Fu, J. C. and Lou, W. Y. W. (2003). Distribution Theory of Runs and Patterns and Its Applications: A Finite Markov Chain Imbedding Approach. World Scientific, Singapore.
Goldstein, L. (1990). Poisson approximation and DNA sequence matching. Commun. Statist. Theory Meth. 19, 41674179.
Han, Q. and Aki, S. (2000). Waiting time problems in a two-state Markov chain. Ann. Inst. Statist. Math. 52, 778789.
Inoue, K. (2004). Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials. Ann. Inst. Statist. Math. 56, 143168.
Inoue, K. and Aki, S. (2002). Generalized waiting time problems associated with pattern in Pólya's urn scheme. Ann. Inst. Statist. Math. 54, 681688.
Inoue, K. and Aki, S. (2003). Generalized binomial and negative binomial distributions of order k by the ell-overlapping enumeration scheme. Ann. Inst. Statist. Math. 55, 153167.
Inoue, K. and Aki, S. (2005). A generalized Pólya urn model and related multivariate distributions. Ann. Inst. Statist. Math. 57, 4959.
Johnson, N. L. and Kotz, S. (1977). Urn Models and Their Applications. John Wiley, New York.
Klamkin, M. S. and Newman, D. J. (1967). Extensions of the birthday surprise. J. Combinatorial Theory 3, 279282.
Koutras, M. V. (1997). Waiting times and number of appearances of events in a sequence of discrete random variables. In Advances in Combinatorial Methods and Applications to Probability and Statistics, ed. Balakrishnan, N., Birkhäuser, Boston, MA, pp. 363384.
Koutras, M. V. and Alexandrou, V. A. (1997). Sooner waiting time problems in a sequence of trinary trials. J. Appl. Prob. 34, 593609.
Ling, K. D. (1988). On binomial distributions of order k. Statist. Prob. Lett. 6, 247250.
Shmueli, G. and Cohen, A. (2000). Run-related probability functions applied to sampling inspection. Technometrics 42, 188202.
Uchida, M. and Aki, S. (1995). Sooner and later waiting time problems in a two-state Markov chain. Ann. Inst. Statist. Math. 47, 415433.

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed