A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
type: Item
instance of: scholarly article
title: A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
zbMATH Open document ID: 0631.60027
DOI: 10.1007/BF00319109
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 4026443
zbMATH Keywords: number of overlapping appearances of long patterns
zbMATH Keywords: Polya-Aeppli distribution
author: Ourania Chryssaphinou
author: Stavros Papastavridis
MaRDI profile type: Publication
cites work: Q3683367
cites work: The occurrence of sequence patterns in ergodic Markov chains
cites work: How many random digits are required until given sequences are obtained?
cites work: Q5538132
cites work: The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
cites work: Maximal Prefix-Synchronized Codes
cites work: Long repetitive patterns in random sequences
cites work: Periods in strings
cites work: String overlaps, pattern matching, and nontransitive games
cites work: Q4043971
cites work: On sequences of 'pure heads'
cites work: On the Length of the Longest Head-Run for a Markov Chain with Two States
published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete
description: scientific article; zbMATH DE number 4026443