Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T10:56:41.487Z Has data issue: false hasContentIssue false

Poisson approximations for runs and patterns of rare events

Published online by Cambridge University Press:  01 July 2016

Anant P. Godbole*
Affiliation:
Michigan Technological University
*
∗Postal address: Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931, USA.

Abstract

Consider a sequence of Bernoulli trials with success probability p, and let Nn,k denote the number of success runs of length among the first n trials. The Stein–Chen method is employed to obtain a total variation upper bound for the rate of convergence of Nn,k to a Poisson random variable under the standard condition npk→λ. This bound is of the same order, O(p), as the best known for the case k = 1, i.e. for the classical binomial-Poisson approximation. Analogous results are obtained for occurrences of word patterns, where, depending on the nature of the word, the corresponding rate is at most O(pk–m) for some m = 0, 2, ···, k – 1. The technique is adapted for use with two-state Markov chains. Applications to reliability systems and tests for randomness are discussed.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1991 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable