Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T06:00:24.068Z Has data issue: false hasContentIssue false

Strong stochastic convexity: closure properties and applications

Published online by Cambridge University Press:  14 July 2016

J. George Shanthikumar*
Affiliation:
University of California, Berkeley
David D. Yao*
Affiliation:
Columbia University
*
∗ Postal address: School of Business Administration, University of California, Berkeley, CA 94720, USA.
∗∗ Postal address: Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027–6699, USA.

Abstract

A family of random variables {X(θ)} parameterized by the parameter θ satisfies stochastic convexity (SCX) if and only if for any increasing and convex function f(x), Ef[X(θ)] is convex in θ. This definition, however, has a major drawback for the lack of certain important closure properties. In this paper we establish the notion of strong stochastic convexity (SSCX), which implies SCX. We demonstrate that SSCX is a property enjoyed by a wide range of random variables. We also show that SSCX is preserved under random mixture, random summation, and any increasing and convex operations that are applied to a set of independent random variables. These closure properties greatly facilitate the study of parametric convexity of many stochastic systems. Applications to GI/G/1 queues, tandem and cyclic queues, and tree-like networks are discussed. We also demonstrate the application of SSCX in bounding the performance of certain systems.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1991 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable