Abstract
By using a combinatorial method it is shown that for every finite pattern, the distribution of the waiting time for the reversed pattern coincides with that of the waiting time for the original pattern in a multi-state dependent sequence with a certain type of exchangeability. The number of the typical sequences until the occurrence of a given pattern and that of the typical sequences until the occurrence of the reversed pattern are shown to be equal. Further, the corresponding results for the waiting time for the r-th occurrence of the pattern, and for the number of occurrences of a specified pattern in n trials are also studied. Illustrative examples based on urn models are also given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aki, S. and Hirano, K. (1993). Discrete distributions related to succession events in a two-state Markov chain, Statistical Sciences and Data Analysis (eds. K. Matusita, M. L. Puri and T. Hayakawa), 467–474, VSP International Science Publishers, Zeist.
Blom, G. and Thorburn, D. (1982). How many random digits are required until given sequences are obtained?, J. Appl. Probab., 19, 518–531.
Ebneshahrashoob, M. and Sobel, M. (1990). Sooner and later problems for Bernoulli trials: Frequency and run quotas, Statist. Probab. Lett., 9, 5–11.
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed., Wiley, New York.
Fu, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multi-state trials, Statist. Sinica, 6, 957–974.
Fu, J. C. and Koutras, M. V. (1994). Distribution theory of runs: A Markov chain approach, J. Amer. Statist. Assoc., 89, 1050–1058.
Johnson, N. L. and Kotz, S. (1977). Urn Models and Their Application, Wiley, New York.
Koutras, M. V. (1997). Waiting times and number of appearances of events in a sequence of discrete random variables, Advances in Combinatorial Methods and Applications to Probability and Statistics (ed. N. Balakrishnan), 363–384, Birkhäuser, Boston.
Koutras, M. V. and Alexandrou, V. A. (1995). Runs, scans and urn model distributions: A unified Markov chain approach, Ann. Inst. Statist. Math., 47, 743–766.
Robin, S. and Daudin, J. J. (1999). Exact distribution of word occurrences in a random sequence of letters, J. Appl. Probab., 36, 179–193.
Uchida, M. (1998). On generating functions of waiting time problems for sequence patterns of discrete random variables, Ann. Inst. Statist. Math., 50, 655–671.
Author information
Authors and Affiliations
About this article
Cite this article
Aki, S., Hirano, K. On Waiting Time for Reversed Patterns in Random Sequences. Annals of the Institute of Statistical Mathematics 54, 713–718 (2002). https://doi.org/10.1023/A:1022472731832
Issue Date:
DOI: https://doi.org/10.1023/A:1022472731832