Poisson approximations for runs and patterns of rare events

1991 ◽  
Vol 23 (4) ◽  
pp. 851-865 ◽  
Author(s):  
Anant P. Godbole
Keyword(s):  
Success Probability ◽  
Standard Condition ◽  
Random Variable ◽  
Poisson Approximation ◽  
Bernoulli Trials ◽  
Success Runs ◽  
Poisson Random Variable ◽  
Runs And Patterns ◽  
Reliability Systems ◽  
Poisson Approximations

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.

Poisson approximations for runs and patterns of rare events

1991 ◽  
Vol 23 (04) ◽  
pp. 851-865 ◽  
Author(s):  
Anant P. Godbole
Keyword(s):  
Success Probability ◽  
Standard Condition ◽  
Random Variable ◽  
Poisson Approximation ◽  
Bernoulli Trials ◽  
Success Runs ◽  
Poisson Random Variable ◽  
Runs And Patterns ◽  
Reliability Systems ◽  
Poisson Approximations

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.

Poisson approximation for (k1, k2)-events via the Stein-Chen method

2004 ◽  
Vol 41 (4) ◽  
pp. 1081-1092 ◽  
Author(s):  
P. Vellaisamy
Keyword(s):  
Limit Theorem ◽  
Rate Of Convergence ◽  
Upper Bound ◽  
Success Probability ◽  
Random Variable ◽  
Poisson Approximation ◽  
Bernoulli Trials ◽  
Poisson Random Variable ◽  
Markov Dependent Trials ◽  
Special Case

Consider a sequence of independent Bernoulli trials with success probability p. Let N(n; k1, k2) denote the number of times that k1 failures are followed by k2 successes among the first n Bernoulli trials. We employ the Stein-Chen method to obtain a total variation upper bound for the rate of convergence of N(n; k1, k2) to a suitable Poisson random variable. As a special case, the corresponding limit theorem is established. Similar results are obtained for Nk3(n; k1, k2), the number of times that k1 failures followed by k2 successes occur k3 times successively in n Bernoulli trials. The bounds obtained are generally sharper than, and improve upon, some of the already known results. Finally, the technique is adapted to obtain Poisson approximation results for the occurrences of the above-mentioned events under Markov-dependent trials.

Poisson approximation for (k 1, k 2)-events via the Stein-Chen method

2004 ◽  
Vol 41 (04) ◽  
pp. 1081-1092
Author(s):  
P. Vellaisamy
Keyword(s):  
Limit Theorem ◽  
Rate Of Convergence ◽  
Upper Bound ◽  
Success Probability ◽  
Random Variable ◽  
Poisson Approximation ◽  
Bernoulli Trials ◽  
Poisson Random Variable ◽  
Markov Dependent Trials ◽  
Special Case

Consider a sequence of independent Bernoulli trials with success probability p. Let N(n; k 1, k 2) denote the number of times that k 1 failures are followed by k 2 successes among the first n Bernoulli trials. We employ the Stein-Chen method to obtain a total variation upper bound for the rate of convergence of N(n; k 1, k 2) to a suitable Poisson random variable. As a special case, the corresponding limit theorem is established. Similar results are obtained for N k 3 (n; k 1, k 2), the number of times that k 1 failures followed by k 2 successes occur k 3 times successively in n Bernoulli trials. The bounds obtained are generally sharper than, and improve upon, some of the already known results. Finally, the technique is adapted to obtain Poisson approximation results for the occurrences of the above-mentioned events under Markov-dependent trials.

Poisson approximation for some statistics based on exchangeable trials

1983 ◽  
Vol 15 (3) ◽  
pp. 585-600 ◽  
Author(s):  
A. D. Barbour ◽  
G. K. Eagleson
Keyword(s):  
Total Variation ◽  
Limit Theorems ◽  
Random Variables ◽  
Random Variable ◽  
Poisson Approximation ◽  
Total Variation Distance ◽  
Poisson Random Variable ◽  
Variation Distance ◽  
Image Position ◽  
Poisson Approximations

Stein's (1970) method of proving limit theorems for sums of dependent random variables is used to derive Poisson approximations for a class of statistics, constructed from finitely exchangeable random variables.Let be exchangeable random elements of a space and, for I a k-subset of , let XI be a 0–1 function. The statistics studied here are of the form where N is some collection of k -subsets of .An estimate of the total variation distance between the distributions of W and an appropriate Poisson random variable is derived and is used to give conditions sufficient for W to be asymptotically Poisson. Two applications of these results are presented.

Poisson approximation for some statistics based on exchangeable trials

1983 ◽  
Vol 15 (03) ◽  
pp. 585-600 ◽  
Author(s):  
A. D. Barbour ◽  
G. K. Eagleson
Keyword(s):  
Total Variation ◽  
Limit Theorems ◽  
Random Variables ◽  
Random Variable ◽  
Poisson Approximation ◽  
Total Variation Distance ◽  
Poisson Random Variable ◽  
Variation Distance ◽  
Image Position ◽  
Poisson Approximations

Stein's (1970) method of proving limit theorems for sums of dependent random variables is used to derive Poisson approximations for a class of statistics, constructed from finitely exchangeable random variables. Let be exchangeable random elements of a space and, for I a k-subset of , let XI be a 0–1 function. The statistics studied here are of the form where N is some collection of k -subsets of . An estimate of the total variation distance between the distributions of W and an appropriate Poisson random variable is derived and is used to give conditions sufficient for W to be asymptotically Poisson. Two applications of these results are presented.

Poisson approximation for a sum of dependent indicators: an alternative approach

2002 ◽  
Vol 34 (03) ◽  
pp. 609-625 ◽  
Author(s):  
N. Papadatos ◽  
V. Papathanasiou
Keyword(s):  
Total Variation ◽  
Upper Bound ◽  
Random Variables ◽  
Random Variable ◽  
Poisson Approximation ◽  
Total Variation Distance ◽  
Poisson Random Variable ◽  
Birthday Problem ◽  
Alternative Approach ◽  
Variation Distance

The random variablesX1,X2, …,Xnare said to be totally negatively dependent (TND) if and only if the random variablesXiand ∑j≠iXjare negatively quadrant dependent for alli. Our main result provides, for TND 0-1 indicatorsX1,x2, …,Xnwith P[Xi= 1] =pi= 1 - P[Xi= 0], an upper bound for the total variation distance between ∑ni=1Xiand a Poisson random variable with mean λ ≥ ∑ni=1pi. An application to a generalized birthday problem is considered and, moreover, some related results concerning the existence of monotone couplings are discussed.

Poisson approximation for a sum of dependent indicators: an alternative approach

2002 ◽  
Vol 34 (3) ◽  
pp. 609-625 ◽  
Author(s):  
N. Papadatos ◽  
V. Papathanasiou
Keyword(s):  
Total Variation ◽  
Upper Bound ◽  
Random Variables ◽  
Random Variable ◽  
Poisson Approximation ◽  
Total Variation Distance ◽  
Poisson Random Variable ◽  
Birthday Problem ◽  
Alternative Approach ◽  
Variation Distance

The random variables X1, X2, …, Xn are said to be totally negatively dependent (TND) if and only if the random variables Xi and ∑j≠iXj are negatively quadrant dependent for all i. Our main result provides, for TND 0-1 indicators X1, x2, …, Xn with P[Xi = 1] = pi = 1 - P[Xi = 0], an upper bound for the total variation distance between ∑ni=1Xi and a Poisson random variable with mean λ ≥ ∑ni=1pi. An application to a generalized birthday problem is considered and, moreover, some related results concerning the existence of monotone couplings are discussed.

scholarly journals A Compound Poisson Approximation Inequality

2006 ◽  
Vol 43 (01) ◽  
pp. 282-288
Author(s):  
Erol A. Peköz
Keyword(s):  
System Reliability ◽  
Random Variable ◽  
Poisson Approximation ◽  
Poisson Random Variable ◽  
Sequence Pattern ◽  
Compound Poisson ◽  
Compound Poisson Approximation ◽  
Numerical Example

We give conditions under which the number of events which occur in a sequence ofm-dependent events is stochastically smaller than a suitably defined compound Poisson random variable. The results are applied to counts of sequence pattern appearances and to system reliability. We also provide a numerical example.

scholarly journals Periodic Solutions of One-Dimensional Cellular Automata with Uniformly Chosen Random Rules

2021 ◽  
Vol 28 (4) ◽  
Author(s):  
Janko Gravner ◽  
Xiaochen Liu
Keyword(s):  
Cellular Automata ◽  
Periodic Solutions ◽  
Main Tool ◽  
Random Variable ◽  
Poisson Approximation ◽  
Spatial Period ◽  
Finite Range ◽  
Poisson Random Variable ◽  
One Dimensional ◽  
Stein Method

We study cellular automata whose rules are selected uniformly at random. Our setting are two-neighbor one-dimensional rules with a large number $n$ of states. The main quantity we analyze is the asymptotic distribution, as $n \to \infty$, of the number of different periodic solutions with given spatial and temporal periods. The main tool we use is the Chen-Stein method for Poisson approximation, which establishes that the number of periodic solutions, with their spatial and temporal periods confined to a finite range, converges to a Poisson random variable with an explicitly given parameter. The limiting probability distribution of the smallest temporal period for a given spatial period is deduced as a corollary and relevant empirical simulations are presented.

scholarly journals A Compound Poisson Approximation Inequality

2006 ◽  
Vol 43 (1) ◽  
pp. 282-288 ◽  
Author(s):  
Erol A. Peköz
Keyword(s):  
System Reliability ◽  
Random Variable ◽  
Poisson Approximation ◽  
Poisson Random Variable ◽  
Sequence Pattern ◽  
Compound Poisson ◽  
Compound Poisson Approximation ◽  
Numerical Example

We give conditions under which the number of events which occur in a sequence of m-dependent events is stochastically smaller than a suitably defined compound Poisson random variable. The results are applied to counts of sequence pattern appearances and to system reliability. We also provide a numerical example.

Sign in / Sign up

Export Citation Format

Share Document