De Moivre-Laplace and Poisson Limit Theorems

1992 ◽  
pp. 30-42
Author(s):  
Yakov G. Sinai
Keyword(s):  
Limit Theorems ◽  
Poisson Limit

A Poisson limit theorem for incomplete symmetric statistics

1983 ◽  
Vol 20 (01) ◽  
pp. 47-60 ◽  
Author(s):  
M. Berman ◽  
G. K. Eagleson
Keyword(s):  
Limit Theorem ◽  
Limit Theorems ◽  
Random Variables ◽  
Asymptotic Distributions ◽  
Poisson Limit ◽  
Symmetric Statistics ◽  
Limit Result ◽  
Independent Identically Distributed

Silverman and Brown (1978) have derived Poisson limit theorems for certain sequences of symmetric statistics, based on a sample of independent identically distributed random variables. In this paper an incomplete version of these statistics is considered and a Poisson limit result shown to hold. The powers of some tests based on the incomplete statistic are investigated and the main results of the paper are used to simplify the derivations of the asymptotic distributions of some statistics previously published in the literature.

Rates of Poisson convergence for U-statistics

1979 ◽  
Vol 16 (2) ◽  
pp. 428-432 ◽  
Author(s):  
T. C. Brown ◽  
B. W. Silverman
Keyword(s):  
Rate Of Convergence ◽  
Limit Theorems ◽  
Plane Region ◽  
U Statistics ◽  
Poisson Limit ◽  
Special Case

Poisson limit theorems for U-statistics are studied. A general rate of convergence is obtained; this rate is improved for the special case where the U-statistic arises from the consideration of distances between uniformly distributed points in a well-behaved plane region.

Short distances, flat triangles and Poisson limits

1978 ◽  
Vol 15 (04) ◽  
pp. 815-825 ◽  
Author(s):  
Bernard Silverman ◽  
Tim Brown
Keyword(s):  
Spatial Data ◽  
Limit Theorems ◽  
Nearest Neighbour ◽  
Poisson Limit

Motivated by problems in the analysis of spatial data, we prove some general Poisson limit theorems for the U-statistics of Hoeffding (1948). The theorems are applied to tests of clustering or collinearities in plane data; nearest neighbour distances are also considered.

Compound Poisson limit theorems for Markov chains

1997 ◽  
Vol 34 (1) ◽  
pp. 24-34 ◽  
Author(s):  
Shoou-Ren Hsiau
Keyword(s):  
Markov Chain ◽  
Limit Theorem ◽  
Markov Chains ◽  
Limit Theorems ◽  
Compound Poisson ◽  
Poisson Limit

This paper establishes a compound Poisson limit theorem for the sum of a sequence of multi-state Markov chains. Our theorem generalizes an earlier one by Koopman for the two-state Markov chain. Moreover, a similar approach is used to derive a limit theorem for the sum of the k th-order two-state Markov chain.

Rates of Poisson convergence for U-statistics

1979 ◽  
Vol 16 (02) ◽  
pp. 428-432 ◽  
Author(s):  
T. C. Brown ◽  
B. W. Silverman
Keyword(s):  
Rate Of Convergence ◽  
Limit Theorems ◽  
Plane Region ◽  
U Statistics ◽  
Poisson Limit ◽  
Special Case

Poisson limit theorems for U-statistics are studied. A general rate of convergence is obtained; this rate is improved for the special case where the U-statistic arises from the consideration of distances between uniformly distributed points in a well-behaved plane region.

Almost sure limit theorems for random allocations

2005 ◽  
Vol 42 (2) ◽  
pp. 173-194
Author(s):  
István Fazekas ◽  
Alexey Chuprunov
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Limit Theorems ◽  
Random Variables ◽  
Central Domain ◽  
Almost Sure Limit Theorem ◽  
The Central Limit Theorem ◽  
Almost Sure Limit Theorems ◽  
Poisson Limit

Almost sure limit theorems are presented for random allocations. A general almost sure limit theorem is proved for arrays of random variables. It is applied to obtain almost sure versions of the central limit theorem for the number of empty boxes when the parameters are in the central domain. Almost sure versions of the Poisson limit theorem in the left domain are also proved.

Two poisson limit theorems for the coupon collector’s problem with group drawings

2021 ◽  
Vol 58 (4) ◽  
pp. 966-977
Author(s):  
Judith Schilling ◽  
Norbert Henze
Keyword(s):  
Limit Theorem ◽  
Waiting Time ◽  
Limit Theorems ◽  
Limit Distributions ◽  
Different Types ◽  
Complete Series ◽  
Uniform Case ◽  
Poisson Limit ◽  
Coupon Collector's Problem ◽  
Special Case

AbstractIn the collector’s problem with group drawings, s out of n different types of coupon are sampled with replacement. In the uniform case, each s-subset of the types has the same probability of being sampled. For this case, we derive a Poisson limit theorem for the number of types that are sampled at most $c-1$ times, where $c \ge 1$ is fixed. In a specified approximate nonuniform setting, we prove a Poisson limit theorem for the special case $c=1$ . As corollaries, we obtain limit distributions for the waiting time for c complete series of types in the uniform case and a single complete series in the approximate nonuniform case.

Sign in / Sign up

Export Citation Format

Share Document