Generalized stochastic convexity and stochastic ordering of mixtures
(1999) Probability in the Engineering and Informational Sciences — Vol. 13, n° 3, p. 275-291 (1999)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- In this paper, a new concept called generalized stochastic convexity is introduced as an extension of the classic notion of stochastic convexity. It relies on the well-known concept of generalized convex functions and corresponds to a stochastic convexity with respect to some Tchebycheff system of functions. A special case discussed in detail is the notion of stochastic s-convexity (s [set membership] [real number symbol]), which is obtained when this system is the family of power functions {x0, x1,..., xs−1}. The analysis is made, first for totally positive families of distributions and then for families that do not enjoy that property. Further, integral stochastic orderings, said of Tchebycheff-type, are introduced that are induced by cones of generalized convex functions. For s-convex functions, they reduce to the s-convex stochastic orderings studied recently. These orderings are then used for comparing mixtures and compound sums, with some illustrations in epidemic theory and actuarial sciences.
- Affiliations
Citations
Denuit, M., Lefèvre, C., & Utev, S. (1999). Generalized stochastic convexity and stochastic ordering of mixtures. Probability in the Engineering and Informational Sciences, 13(3), 275-291. https://doi.org/10.1017/S0269964899133023 (Original work published 1999)