scholarly journals A Poisson limit theorem for Gibbs–Markov maps

2020 ◽  
pp. 1-16
Author(s):  
Xuan Zhang
Keyword(s):  
1996 ◽  
Vol 33 (01) ◽  
pp. 146-155 ◽  
Author(s):  
K. Borovkov ◽  
D. Pfeifer

In this paper we consider improvements in the rate of approximation for the distribution of sums of independent Bernoulli random variables via convolutions of Poisson measures with signed measures of specific type. As a special case, the distribution of the number of records in an i.i.d. sequence of length n is investigated. For this particular example, it is shown that the usual rate of Poisson approximation of O(1/log n) can be lowered to O(1/n 2). The general case is discussed in terms of operator semigroups.


1983 ◽  
Vol 20 (01) ◽  
pp. 47-60 ◽  
Author(s):  
M. Berman ◽  
G. K. Eagleson

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.


1997 ◽  
Vol 34 (1) ◽  
pp. 24-34 ◽  
Author(s):  
Shoou-Ren Hsiau

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.


2003 ◽  
Vol 24 (3) ◽  
pp. 298-306
Author(s):  
Fang Da-fan ◽  
Wang Han-xing ◽  
Tang Mao-ning

2004 ◽  
Vol 48 (1) ◽  
pp. 1-20 ◽  
Author(s):  
Manfred Denker ◽  
Mikhail Gordin ◽  
Anastasya Sharova

2009 ◽  
Vol 46 (02) ◽  
pp. 585-592
Author(s):  
Anna Pósfai

In this paper we refine a Poisson limit theorem of Gnedenko and Kolmogorov (1954): we determine the error order of a Poisson approximation for sums of asymptotically negligible integer-valued random variables that converge in distribution to the Poisson law. As an application of our results, we investigate the case of the coupon collector's problem when the distribution of the collector's waiting time is asymptotically Poisson.


2005 ◽  
Vol 42 (2) ◽  
pp. 173-194
Author(s):  
István Fazekas ◽  
Alexey Chuprunov

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.


Sign in / Sign up

Export Citation Format

Share Document