Another Look at Random Infinite Divisibility

dc.creatorSatheesh, S.
dc.date2003-04-30
dc.date2005-02-12
dc.date.accessioned2026-07-07T08:06:07Z
dc.date.available2026-07-07T08:06:07Z
dc.descriptionThe drawbacks in the formulations of random infinite divisibility in Sandhya (1991, 1996), Gnedenko and Korelev (1996), Klebanov and Rachev (1996), Bunge (1996) and Kozubowski and Panorska (1996) are pointed out. For any given Laplace transform, we conceive random (N) infinite divisibility w.r.t a class of probability generating functions derived from the Laplace transform itself. This formulation overcomes the said drawbacks, and the class of probability generating functions is useful in transfer theorems for sums and maximums in general. Generalizing the concepts of attraction (and partial attraction) in the classical and the geometric summation setup to our formulation we show that the domains of attraction (and partial attraction)in all these setups are same. We also establish a necessary and sufficient condition for the convergence to infinitely divisible laws from that of an N-sum and conversely, that is an analogue of Theorem.4.6.5 in Gnedenko and Korelev (1996, p.149). The role of the divisibiltiy of N and the Laplace transform on that of this formulation is also discussed.
dc.descriptionAdded the Journal publication reference, in the journal format, 22 pages and typos are corrected
dc.identifierhttps://arxiv.org/abs/math/0304499
dc.identifierhttp://arxiv.org/abs/math/0304499
dc.identifierStatistical Methods, 2004, 6 (2),123 - 144
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130497
dc.subjectProbability
dc.subjectStatistics Theory
dc.subject60E07, 60F05 (Primary) 60E10, 62E10 (Secondary)
dc.titleAnother Look at Random Infinite Divisibility
dc.typetext

Files

Collections