2022
DOI: 10.1007/s10958-022-06123-0
|View full text |Cite
|
Sign up to set email alerts
|

Revisiting the Product of Random Variables

Abstract: For a large class of distribution functions we study properties of the product of random variables X and Y . We take into account the dependency structure between X and Y by making assumptions about the asymptotic equality P(X > x|Y = y) ∼ h(y)P(X > x) as x → ∞, uniformly for y in the range of Y . As particular consequences, some well-known results concerning the product of random variables are reviewed, among them the Breiman's theorem. An application is made in the case where the dependence between X and Y i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 46 publications
0
1
0
Order By: Relevance
“…We consider the non-negative claim sizes, where it was possible to avoid condition (4.1). It worth to mention that recently several attempts to study this problem under dependent random variables, as for example in [5], [35], [59] among others. Furthermore, in [32] we find for random variable X, whose support is the whole real axis R, that class OA manifests closure property with respect to convolution product under the condition (4.1), from this aspect, the second part of Theorem 4.1 extends this result in non-negative case.…”
Section: F X∨y ∈ Amentioning
confidence: 99%
“…We consider the non-negative claim sizes, where it was possible to avoid condition (4.1). It worth to mention that recently several attempts to study this problem under dependent random variables, as for example in [5], [35], [59] among others. Furthermore, in [32] we find for random variable X, whose support is the whole real axis R, that class OA manifests closure property with respect to convolution product under the condition (4.1), from this aspect, the second part of Theorem 4.1 extends this result in non-negative case.…”
Section: F X∨y ∈ Amentioning
confidence: 99%