S�lections par mots-cl�s
(Selections by key-words)
Papiers lus
(acc�s r�serv� / Private)

R�f�rences bibliographiques / Bibliography


Mot-cl�: waiting time for first occurrences of patterns

[1] Banjevic, D. On some statistics connected with runs in markov chains. J. Appl. Prob. 25 (1988), 815-821.

[2] Benevento, R. The occurrence of sequence patterns in ergodic markov chains. Stoch. Proc. Appl. 17 (1984), 369-373.

[3] Blom, G. On the mean number of random digits until a given sequence occurs. J. Appl. Prob. 19 (1982), 136-143.

[4] Blom, G., and Thorburn, D. How many random digits are required until given sequences are obtained ? J. Appl. Prob. 19 (1982), 518-531.

[5] Breen, S., Waterman, M. S., and Zhang, N. Renewal theory for several patterns. J. Appl. Prob. 22 (1985), 228-234.

[6] Feller, W. An introduction to Probability Theory and its Applications. Wiley, New York, 1968.

[7] Gerber, H. U., and Li, S.-Y. The occurrence of sequence patterns in repeated experiments and hitting times in a markov chain. Stoch. Proc. Appl. 11 (1981), 101-108.

[8] Li, S. A martingale approach to the study of occurrence of sequences patterns in repeated experiments. Ann. Prob. 8 (1980), 1171-1176.

[9] Rudander, J. On the first occurrence of a given pattern in a semi-Markov process. PhD thesis, University of Uppsala, 1996.

[10] Schwager. Run probabilities in sequences of markov-dependent trials. J. Amer. Statist. Soc. 78 (1983), 168-175.

[11] Thorburn, D. On the mean number of trials until the last trials satisfy a given condition. Stoch. Proc. Appl. 16 (1983), 211-217.

Fri Feb 11 09:39:23 MET 2000

Retour � la liste