A comparison of two upper bounds for the tails of compound distributions, both defined in terms of a new worse than used (NWU) distribution, reveals that one is sharper in the decreasing failure rate (DFR) case. An inductive argument is employed to construct a lower bound in terms of a new better th
โฆ LIBER โฆ
Bounds on the tails of convolutions of compound distributions
โ Scribed by Gordon E. Willmot; Xiadong Lin
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 28 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0167-6687
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On the relationship between bounds on th
โ
Gordon E. Willmot
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 338 KB
Variance upper bounds and convolutions o
โ
A.M. Abouammoh; A.F. Mashhour
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 528 KB
Upper bounds for the tail of the compoun
โ
E.G. Willmot; X. Lin
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 105 KB
A general upper bound for the tail of the compound negative binomial distribution is constructed. By establishing a connection with the individual risk mode the upper bound is seen to be a (possibly degenerate) mixture of tails of gamma distribution. The bound is sharp in that it is an equality in t
On the Onesided Tails of Infinitely Divi
โ
M. Riedel
๐
Article
๐
1975
๐
John Wiley and Sons
๐
English
โ 289 KB
On mergers of distributions and distribu
โ
W. Olbricht
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 830 KB
On Defining the Convolution of Distribut
โ
Brian Fisher
๐
Article
๐
1982
๐
John Wiley and Sons
๐
English
โ 319 KB