Strong stochastic convexity: closure properties and applications

Jeyaveerasingam George Shanthikumar · David D. W. Yao

59 citations0/0 files storedJournal of Applied Probability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Probability and Risk Models

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 59 citations exist upstream.

References

1986Comparison Methods for Queues and Other Stochastic Models.1993An introduction to queueing theory 1952The theory of queues with a single server 1984Comparison Methods for Queues and Other Stochastic Models 1982Introduction to Queueing Theory 1983Introduction to Queueing Theory (2nd ed.).1974Technical Note—A Last Word on L = λW 1990Concavity of the throughput of tandem queueing systems with finite buffer storage space

Cited by

1992A new ordering for stochastic majorization: theory and applications 1993Tandem queues with general blocking: A unified model and comparison results 2016Multi‐Treatment Inventory Allocation in Humanitarian Health Settings under Funding Constraints 2005Backorder minimization in multiproduct assemble-to-order systems 1991Stochastic convexity for multidimensional processes and its applications 2008The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.