Maximum Waiting Time When the Size of the Alphabet Increases

Tamás F. Móri
Additional contact information
Tamás F. Móri: Loránd Eötvös University, Department of Probability Theory

A chapter in Mathematical Statistics and Probability Theory, 1987, pp 169-178 from Springer

Abstract: Abstract Observing a sequence of random letters coming from a finite alphabet we consider the waiting time till each of a given subset of length k words occurs as a run. A limit theorem is derived for this waiting time as the size of the alphabet and of the given set of words tends to infinity. The main difficulty compared with the classical case k=l is the presence of overlapping between the words.

Keywords: Absolute Constant; Finite Alphabet; Random Letter; Large Deviation Result; Limit Distribution Function (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-3965-3_16

Ordering information: This item can be ordered from
http://www.springer.com/9789400939653

DOI: 10.1007/978-94-009-3965-3_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().