Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-09T01:32:01.616Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Part of: Distribution theory - Probability Markov processes

Published online by Cambridge University Press:  14 July 2016

Kiyoshi Inoue  and
Sigeo Aki
Kiyoshi Inoue*
Affiliation:
Seikei University
Sigeo Aki*
Affiliation:
Kansai University
*
∗ Postal address: Faculty of Economics, Seikei University, 3-3-1 Kichijoji-Kitamachi, Musasino-shi, Tokyo, 180-8633, Japan. Email address: [email protected]
∗∗ Postal address: Department of Mathematics, Faculty of Engineering, Kansai University, 3-3-35 Yamate-cho, Suita-shi, Osaka, 564-8680, Japan.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Keywords

Compound patternmultistate trialsooner waiting timelater waiting timerunenumeration schemeprobability functionprobability generating functiondouble generating function

MSC classification

Primary: 60E05: Distributions
Secondary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Type
Research Article
Information
Journal of Applied Probability , Volume 44 , Issue 1 , March 2007 , pp. 71 - 81
Copyright
Copyright © Applied Probability Trust 2007 

References

Adler, I. and Ross, S. (2001). The coupon subset collection problem. J. Appl. Prob. 38, 737–746.Google Scholar
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. 467–474.Google Scholar
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, 767–777.Google Scholar
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, 773–787.Google Scholar
Balakrishnan, N. and Koutras, M. V. (2002). Runs and Scans with Applications. John Wiley, New York.Google Scholar
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, 155–169.Google Scholar
Ebneshahrashoob, M. and Sobel, M. (1990). Sooner and later waiting time problems for Bernoulli trials: frequency and run quotas. Statist. Prob. Lett. 9, 5–11.Google Scholar
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. I, 3rd edn. John Wiley, New York.Google Scholar
Fu, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statistica Sinica 6, 957–974.Google Scholar
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, 70–80.Google Scholar
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, 623–642.CrossRefGoogle Scholar
Fu, J. C. and Koutras, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 1050–1058.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Goldstein, L. (1990). Poisson approximation and DNA sequence matching. Commun. Statist. Theory Meth. 19, 4167–4179.CrossRefGoogle Scholar
Han, Q. and Aki, S. (2000). Waiting time problems in a two-state Markov chain. Ann. Inst. Statist. Math. 52, 778–789.Google Scholar
Inoue, K. (2004). Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials. Ann. Inst. Statist. Math. 56, 143–168.Google Scholar
Inoue, K. and Aki, S. (2002). Generalized waiting time problems associated with pattern in Pólya's urn scheme. Ann. Inst. Statist. Math. 54, 681–688.CrossRefGoogle Scholar
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, 153–167.Google Scholar
Inoue, K. and Aki, S. (2005). A generalized Pólya urn model and related multivariate distributions. Ann. Inst. Statist. Math. 57, 49–59.Google Scholar
Johnson, N. L. and Kotz, S. (1977). Urn Models and Their Applications. John Wiley, New York.Google Scholar
Klamkin, M. S. and Newman, D. J. (1967). Extensions of the birthday surprise. J. Combinatorial Theory 3, 279–282.Google Scholar
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. 363–384.CrossRefGoogle Scholar
Koutras, M. V. and Alexandrou, V. A. (1997). Sooner waiting time problems in a sequence of trinary trials. J. Appl. Prob. 34, 593–609.Google Scholar
Ling, K. D. (1988). On binomial distributions of order k. Statist. Prob. Lett. 6, 247–250.Google Scholar
Shmueli, G. and Cohen, A. (2000). Run-related probability functions applied to sampling inspection. Technometrics 42, 188–202.Google Scholar
Uchida, M. and Aki, S. (1995). Sooner and later waiting time problems in a two-state Markov chain. Ann. Inst. Statist. Math. 47, 415–433.Google Scholar