Explicit distributional results in pattern formation

Annals of Applied Probability

Volumn 7, Issue 3, 1997, Pages 666-678

  Stefanov, V T ^a   Pakes, A G ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Exponential family; Markov chain; Run; Stopping time

Indexed keywords

EID: 0031526698     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1034801248     Document Type: Article

References (26)

1. AKI, S. and HIRANO, K. (1994). Distributions of numbers of failures and successes until the first consecutive k successes. Ann. Inst. Statist. Math. 46 193-202.
2. AKI, S. and HIRANO, K. (1995). Joint distributions of numbers of success-runs and failures until the first consecutive k successes. Ann. Inst. Statist. Math. 47 225-235.
3. BANJEVIC, D. (1994). Pattern recognition in Markov chains. In Runs and Patterns in Probability (A. P. Godbole and S. G. Papastavridis, eds.) 213-230. Kluwer, Dordrecht.
4. BARNDORFF-NIELSEN, O. (1978). Information and Exponential Families. Wiley, Chichester.
5. BARNDORFF-NIELSEN, O. (1980). Conditionality resolutions. Biometrika 67 293-310.
6. BIGGINS, J. D. and CANNINGS, C. (1987). Markov renewal processes, counters and repeated sequences in Markov chains. Adv. in Appl. Probab. 19 521-545.
7. BISHOP, D. T., WILLIAMSON, J. A. and SKOLNICK, M. H. (1983). A model for restriction fragment length distributions. American Journal of Human Genetics 35 795-815.
8. BLOM, G. and THORBURN, D. (1982). How many random digits are required until given sequences are obtained? J. Appl. Probab. 19 518-531.
9. BREEN, S., WATERMAN, M. S. and ZHANG, N. (1985). Renewal theory for several patterns. J. Appl. Probab. 22 228-234.
10. BROWN, L. (1986). Fundamentals of Statistical Exponential Families. IMS, Hayward, CA.
11. CHRYSSAPHINOU, O. and PAPASTAVRIDIS, S. (1988). A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials. Probab. Theory Related Fields 79 129-143.
12. CHRYSSAPHINOU, O. and PAPASTAVRIDIS, S. (1990). The occurrence of a sequence of patterns in repeated dependent experiments. Theory Probab. Appl. 35 167-173.
13. FELLER, W. (1950). An Introduction of Probability Theory and Its Applications 1. Wiley, New York.
14. FU, J. C. and KOUTRAS, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89 1050-1058.
15. GARDNER, M. (1988). Time Travel and Other Mathematical Bewilderments. W. H. Freeman, New York.
16. GERBER, H. and LI, S-Y. R. (1981). The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain. Stochastic Process. Appl. 11 101-108.
17. GODBOLE, A. P. and SCHAEFFNER, A. A. (1993). Improved Poisson approximation for word patterns. Adv. in Appl. Probab. 25 334-347.
18. GUIBAS, L. J. and ODLYZKO, A. M. (1980). Long repetitive patterns in random sequences. Z. Wahrsch. Verw. Gebiete 53 241-262.
19. GUIBAS, L. J. and ODLYZKO, A. M. (1981). String overlaps, pattern matching, and nontransitive games. J. Combin. Theory A 30 183-208.
20. LI, S-Y. R. (1980). A martingale approach to the study of occurrence of sequence patterns in repeated experiments. Ann. Probab. 8 1171-1176.
21. LING, K. D. (1988). On binomial distributions of order k. Statist. Probab. Lett. 6 247-250.
22. MOHANTY, S. G. (1994). Success runs of length k in Markov dependent trials. Ann. Inst. Statist. Math. 46 777-796.
23. MOOD, A. M. (1940). The distribution theory of runs. Ann. Math. Statist. 11 367-392.
24. SCHBATH, S. (1995). Compound Poisson approximation of word counts in DNA sequences. ESAIM: Probability and Statistics 1 1-16.
25. STEFANOV, V. T. (1991). Noncurved exponential families associated with observations over finite state Markov chains. Scand J. Statist. 18 353-356.
26. STEFANOV, V. T. (1995). Explicit limit results for minimal sufficient statistics and maximum likelihood estimators in some Markov processes: exponential families approach. Ann. Statist. 23 1073-1101.