Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-28T15:30:15.053Z Has data issue: false hasContentIssue false

On the stochastic ordering of waiting times for patterns in sequences of random digits

Published online by Cambridge University Press:  14 July 2016

Gunnar Blom*
Affiliation:
University of Lund
*
Postal address: Department of Mathematical Statistics, University of Lund, Box 725, S-220 07 Lund, Sweden.

Abstract

Random digits are collected one at a time until a pattern with given digits is obtained. Blom (1982) and others have determined the mean waiting time for such a pattern. It is proved that when a given pattern has larger mean waiting time than another pattern, then the waiting time for the former is stochastically larger than that for the latter. An application is given to a coin-tossing game.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1984 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Blom, G. (1982) On the mean number of random digits until a given sequence occurs. J. Appl. Prob. 19, 136143.Google Scholar
Blom, G. and Thorburn, D. (1982) How many random digits are required until given sequences are obtained? J. Appl. Prob. 19, 518531.Google Scholar
Chen, R. and Zame, A. (1979) On fair coin-tossing games. J. Multivariate Anal. 9, 150156.Google Scholar
Li, S. R. (1980) A martingale approach to the study of occurrence of sequence patterns in repeated experiments. Ann. Prob. 8, 11711176.CrossRefGoogle Scholar
Ross, S. M. (1983) Stochastic Processes. Wiley, New York.Google Scholar