A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials (Q1094743)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials |
scientific article; zbMATH DE number 4026443
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials |
scientific article; zbMATH DE number 4026443 |
Statements
A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials (English)
0 references
1988
0 references
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 Polya-Aeppli distribution.
0 references
number of overlapping appearances of long patterns
0 references
Polya-Aeppli distribution
0 references
0 references
0 references
