Strong stochastic convexity: closure properties and applications
- 1 March 1991
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 28 (1) , 131-145
- https://doi.org/10.2307/3214746
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.Keywords
This publication has 10 references indexed in Scilit:
- Parametric stochastic convexity and concavity of stochastic processesAnnals of the Institute of Statistical Mathematics, 1990
- Concavity of the throughput of tandem queueing systems with finite buffer storage spaceAdvances in Applied Probability, 1990
- Convexity of a set of stochastically ordered random variablesAdvances in Applied Probability, 1990
- Stochastic convexity and its applicationsAdvances in Applied Probability, 1988
- Single run optimization of a SIMAN model for closed loop flexible assembly systemsPublished by Association for Computing Machinery (ACM) ,1987
- Solution of a statistical optimization problem by rearrangement methodsMetrika, 1983
- Technical Note—A Note on Waiting Times in Single Server QueuesOperations Research, 1983
- Optimal Selection of CPU Speed, Device Capacities, and File AssignmentsJournal of the ACM, 1980
- Technical Note—A Last Word on L = λWOperations Research, 1974
- The theory of queues with a single serverMathematical Proceedings of the Cambridge Philosophical Society, 1952