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
On the waiting time till each of some given patterns occurs as a run
Download PDF
Download PDF
  • Published: September 1991

On the waiting time till each of some given patterns occurs as a run

  • Tamás F. Móri1 

Probability Theory and Related Fields volume 87, pages 313–323 (1991)Cite this article

  • 60 Accesses

  • 16 Citations

  • Metrics details

Summary

A limit theorem is proved for the waiting time till each of a given set of lengthn patterns occurs as a run in a sequence of i.i.d. random variables distributed uniformly on {1,2,...,d}. A heuristic approach called the independence principle is introduced which can be applied to similar problems connected with waiting times.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  • Erdös, P., Rényi, A.: On a new law of large numbers. J. Anal. Math.23, 103–111 (1970)

    Google Scholar 

  • Erdös, P., Révész, P.: On the length of the longest head-run. In: Coll. Math. Soc. J. Bolyai 16, Topics in Information Theory, Keszthely, Hungary 1975. Amsterdam: Narth Holland 1976

    Google Scholar 

  • Galambos, J.: On the sieve methods in probability theory I. Stud. Sci. Math. Hung.1, 39–50 (1966)

    Google Scholar 

  • Galambos, J.: The asymptotic theory of extreme order statistics. New York: Wiley 1978

    Google Scholar 

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

    Google Scholar 

  • Li, S.R.: A martingale approach to the study of occurrence of sequence patterns in repeated experiments. Ann. Probab.8, 1171–1176 (1980)

    Google Scholar 

  • Móri, T.F.: Large deviation results for waiting times in repeated experiments. Acta Math. Acad. Sci. Hungar.45, 213–221 (1985)

    Google Scholar 

  • Móri, T.F.: On the expectation of the maximum waiting time. Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput.7, 111–115 (1987)

    Google Scholar 

  • Móri, T.F., Székely, G.J.: Asymptotic independence of ‘pure head’ stopping times. Stat. Probab. Lett.2, 5–8 (1984)

    Google Scholar 

  • Shukle, R., Shrivastava, R.C.: The statistical analysis of direct repeats in nucleic acid sequences. J. Appl. Probab.22, 15–24 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Probability Theory, Eötvös University, Múzeum krt. 6-8, H-1088, Budapest, Hungary

    Tamás F. Móri

Authors
  1. Tamás F. Móri
    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

Móri, T.F. On the waiting time till each of some given patterns occurs as a run. Probab. Th. Rel. Fields 87, 313–323 (1991). https://doi.org/10.1007/BF01312212

Download citation

  • Received: 19 September 1986

  • Revised: 15 April 1990

  • Issue Date: September 1991

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

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
  • Probability Theory
  • Limit Theorem
  • Mathematical Biology
  • Heuristic Approach
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