Summary
A sequence of independent experiments is performed, each one producing a letter from a given alphabet. We study the number of overlapping appearances of a given pattern of letters and we prove that, under quite general conditions, the number of overlapping appearances of long patterns is approximately distributed according to a Pólya-Aeppli distribution.
References
Barbour, A.D., Eagleson, G.K.: Poisson convergence for dissociated statistics. J.R. Statist. Soc. B 46, 397–402 (1984)
Benevento, R.V.: The occurrence of sequence patterns in ergodic Markov chains. Stochastic Processes Appl. 17, 369–373 (1984)
Blom, G., Thorburn, D.: How many random digits are required until given sequences are obtained? Appl. Probab. 19, 518–531 (1982)
Chrysaphinou, O., Papastavridis, S.: A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials. J. Appl. Probab. 25 (1988)
Erdös, P., Révész, P.: On the length of the longest head-run. Colloq. Math. Soc. Janos Bolyai, Keszthely 16, 219–228 (1975)
Feller, W.: An introduction to probability theory and its application. New York: Wiley 1968
Földes, A.: The limit distribution of the length of the longest head-run. Period. Math. Hung. 10, 301–310 (1970)
Gerber, H.U., Li, S.-Y.: The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain. Stochastic Processes Appl. 11, 101–108 (1981)
Guibas, L.J., Odlyzko, A.M.: Maximal prefix-synchronized codes. SIAM J. Appl. Math. 35, 401–418 (1978)
Guibas, L.J., Odlyzko, A.M.: Long repetive patterns in random sequences. Z. Wahrscheinlichkeitstheor. Verw. Geb. 53, 241–262 (1980)
Guibas, L.J., Odlyzko, A.M.: Periods of strings. J. Comb. Theory Ser. A, 30, 19–42 (1981)
Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching and non-transitive games. J. Comb. Theory Ser. A, 30, 183–208 (1981)
Johnson, N.L., Kotz, S.: Discrete distributions. Boston: Houghton Mifflin 1969
Komlós, J., Tusnády, G.: On sequences of “pure heads”. Ann. Probab. 3, 608–617 (1975)
Nemetz, T., Kusolitsch, N.: On the longest run of coincidences. Z. Wahrscheinlichkeitstheor. Verw. Geb. 61, 59–73 (1982)
Révész, P.: Strong theorems on coin tossing. Proc. 1978 Int. Congress of Mathematicians, Helsinki, pp. 749–754 (1980)
Samarova, S.S.: On the length of the longest head-run for a Markov chain with two states. Theory Probab. Appl. 26, 498–509 (1981)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chrysaphinou, O., Papastavridis, S. A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials. Probab. Th. Rel. Fields 79, 129–143 (1988). https://doi.org/10.1007/BF00319109
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00319109
Keywords
- Stochastic Process
- General Condition
- Independent Experiment
- Probability Theory
- Limit Theorem