Asymptotic Expansions in the Exponent: a Compound Poisson Approach

1997 ◽  
Vol 29 (02) ◽  
pp. 374-387 ◽  
Author(s):  
V. Čekanavičius

The accuracy of the Normal or Poisson approximations can be significantly improved by adding part of an asymptotic expansion in the exponent. The signed-compound-Poisson measures obtained in this manner can be of the same structure as the Poisson distribution. For large deviations we prove that signed-compound-Poisson measures enlarge the zone of equivalence for tails.

1997 ◽  
Vol 29 (2) ◽  
pp. 374-387 ◽  
Author(s):  
V. Čekanavičius

The accuracy of the Normal or Poisson approximations can be significantly improved by adding part of an asymptotic expansion in the exponent. The signed-compound-Poisson measures obtained in this manner can be of the same structure as the Poisson distribution. For large deviations we prove that signed-compound-Poisson measures enlarge the zone of equivalence for tails.


2003 ◽  
Vol 35 (1) ◽  
pp. 228-250 ◽  
Author(s):  
V. Čekanavičius ◽  
Y. H. Wang

Sums of independent random variables concentrated on the same finite discrete, not necessarily lattice, set of points are approximated by compound Poisson distributions and signed compound Poisson measures. Such approximations can be more accurate than the normal distribution. Short asymptotic expansions are constructed.


2003 ◽  
Vol 35 (01) ◽  
pp. 228-250 ◽  
Author(s):  
V. Čekanavičius ◽  
Y. H. Wang

Sums of independent random variables concentrated on the same finite discrete, not necessarily lattice, set of points are approximated by compound Poisson distributions and signed compound Poisson measures. Such approximations can be more accurate than the normal distribution. Short asymptotic expansions are constructed.


2007 ◽  
Vol 39 (01) ◽  
pp. 128-140 ◽  
Author(s):  
Etienne Roquain ◽  
Sophie Schbath

We derive a new compound Poisson distribution with explicit parameters to approximate the number of overlapping occurrences of any set of words in a Markovian sequence. Using the Chen-Stein method, we provide a bound for the approximation error. This error converges to 0 under the rare event condition, even for overlapping families, which improves previous results. As a consequence, we also propose Poisson approximations for the declumped count and the number of competing renewals.


2003 ◽  
Vol 35 (04) ◽  
pp. 982-1006
Author(s):  
V. Čekanavičius

Sums of independent random variables concentrated on discrete, not necessarily lattice, set of points are approximated by infinitely divisible distributions and signed compound Poisson measures. A version of Kolmogorov's first uniform theorem is proved. Second-order asymptotic expansions are constructed for distributions with pseudo-lattice supports.


2003 ◽  
Vol 35 (4) ◽  
pp. 982-1006 ◽  
Author(s):  
V. Čekanavičius

Sums of independent random variables concentrated on discrete, not necessarily lattice, set of points are approximated by infinitely divisible distributions and signed compound Poisson measures. A version of Kolmogorov's first uniform theorem is proved. Second-order asymptotic expansions are constructed for distributions with pseudo-lattice supports.


2007 ◽  
Vol 39 (1) ◽  
pp. 128-140 ◽  
Author(s):  
Etienne Roquain ◽  
Sophie Schbath

We derive a new compound Poisson distribution with explicit parameters to approximate the number of overlapping occurrences of any set of words in a Markovian sequence. Using the Chen-Stein method, we provide a bound for the approximation error. This error converges to 0 under the rare event condition, even for overlapping families, which improves previous results. As a consequence, we also propose Poisson approximations for the declumped count and the number of competing renewals.


Sign in / Sign up

Export Citation Format

Share Document