On the Number of Appearances of a Word in a Sequence of I.I.D. Trials

Ourania Chryssaphinou (), Stavros Papastavridis () and Eutichia Vaggelatou ()
Additional contact information
Ourania Chryssaphinou: University of Athens
Stavros Papastavridis: University of Athens
Eutichia Vaggelatou: University of Athens

Methodology and Computing in Applied Probability, 1999, vol. 1, issue 3, 329-348

Abstract: Abstract Let X 1,...,X n be a sequence of i.i.d. random variables taking values in an alphabet Ω=ω1,...,ωq,q ≥ 2, with probabilities P(X a=ωi)=p i,a=1,...,n,i=1,...,q. We consider a fixed h-letter word W=w1...wh which is produced under the above scheme. We define by R(W) the number of appearances of W as Renewal (which is equal with the maximum number of non-overlapping appearances) and by N(W) the number of total appearances of W (overlapping ones) in the sequence X a 1≤ a1≤n under the i.i.d. hypothesis. We derive a bound on the total variation distance between the distribution ℒ(R(W)) of the r.v. R(W) and that of a Poisson with parameter E(R(W)). We use the Stein-Chen method and related results from Barbour et al. (1992), as well as, combinatorial results from Schbath (1995b) concerning the periodic structure of the word W. Analogous results are obtained for the total variation distance between the distribution of the r.v. N(W) and that of an appropriate Compound Poisson r.v. Related limit theorems are obtained and via numerical computations our bounds are presented in tables.

Keywords: renewal; total appearances of words; periods; Stein-Chen method (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1010042628865 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:metcap:v:1:y:1999:i:3:d:10.1023_a:1010042628865

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1023/A:1010042628865

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().