Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
Download PDF
Download PDF
  • Published: September 1988

A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials

  • O. Chrysaphinou1 &
  • S. Papastavridis2 

Probability Theory and Related Fields volume 79, pages 129–143 (1988)Cite this article

  • 161 Accesses

  • 23 Citations

  • Metrics details

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.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  • Barbour, A.D., Eagleson, G.K.: Poisson convergence for dissociated statistics. J.R. Statist. Soc. B 46, 397–402 (1984)

    Google Scholar 

  • Benevento, R.V.: The occurrence of sequence patterns in ergodic Markov chains. Stochastic Processes Appl. 17, 369–373 (1984)

    Google Scholar 

  • Blom, G., Thorburn, D.: How many random digits are required until given sequences are obtained? Appl. Probab. 19, 518–531 (1982)

    Google Scholar 

  • 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)

    Google Scholar 

  • Feller, W.: An introduction to probability theory and its application. New York: Wiley 1968

    Google Scholar 

  • Földes, A.: The limit distribution of the length of the longest head-run. Period. Math. Hung. 10, 301–310 (1970)

    Google Scholar 

  • 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)

    Google Scholar 

  • Guibas, L.J., Odlyzko, A.M.: Maximal prefix-synchronized codes. SIAM J. Appl. Math. 35, 401–418 (1978)

    Google Scholar 

  • Guibas, L.J., Odlyzko, A.M.: Long repetive patterns in random sequences. Z. Wahrscheinlichkeitstheor. Verw. Geb. 53, 241–262 (1980)

    Google Scholar 

  • Guibas, L.J., Odlyzko, A.M.: Periods of strings. J. Comb. Theory Ser. A, 30, 19–42 (1981)

    Google Scholar 

  • Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching and non-transitive games. J. Comb. Theory Ser. A, 30, 183–208 (1981)

    Google Scholar 

  • Johnson, N.L., Kotz, S.: Discrete distributions. Boston: Houghton Mifflin 1969

    Google Scholar 

  • Komlós, J., Tusnády, G.: On sequences of “pure heads”. Ann. Probab. 3, 608–617 (1975)

    Google Scholar 

  • Nemetz, T., Kusolitsch, N.: On the longest run of coincidences. Z. Wahrscheinlichkeitstheor. Verw. Geb. 61, 59–73 (1982)

    Google Scholar 

  • 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Athens, Penepistemiopolis, 15781, Athens, Greece

    O. Chrysaphinou

  2. Department of Mathematics, University of Patras, 26110, Patras, Greece

    S. Papastavridis

Authors
  1. O. Chrysaphinou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Papastavridis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received: 05 March 1987

  • Revised: 21 March 1988

  • Issue Date: September 1988

  • DOI: https://doi.org/10.1007/BF00319109

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Stochastic Process
  • General Condition
  • Independent Experiment
  • Probability Theory
  • Limit Theorem
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature