Chebyshev inequalities for products of random variables
From MaRDI portal
Publication:5219675
Abstract: We derive sharp probability bounds on the tails of a product of symmetric non-negative random variables using only information about their first two moments. If the covariance matrix of the random variables is known exactly, these bounds can be computed numerically using semidefinite programming. If only an upper bound on the covariance matrix is available, the probability bounds on the right tails can be evaluated analytically. The bounds under precise and imprecise covariance information coincide for all left tails as well as for all right tails corresponding to quantiles that are either sufficiently small or sufficiently large. We also prove that all left probability bounds reduce to the trivial bound 1 if the number of random variables in the product exceeds an explicit threshold. Thus, in the worst case, the weak-sense geometric random walk defined through the running product of the random variables is absorbed at 0 with certainty as soon as time exceeds the given threshold. The techniques devised for constructing Chebyshev bounds for products can also be used to derive Chebyshev bounds for sums, maxima and minima of non-negative random variables.
Recommendations
Cites work
- scientific article; zbMATH DE number 3133146 (Why is no real title available?)
- scientific article; zbMATH DE number 51724 (Why is no real title available?)
- scientific article; zbMATH DE number 3561857 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3246461 (Why is no real title available?)
- scientific article; zbMATH DE number 3107192 (Why is no real title available?)
- A Survey of the S-Lemma
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- Characterizations of probability distributions by properties of products of random variables
- Distributionally Robust Convex Optimization
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Duality in robust optimization: Primal worst equals dual best
- Generalized Chebyshev Bounds via Semidefinite Programming
- Multivariate Chebyshev Inequalities
- On Generalizations of Tchebychef's Inequality
- On duality theory of conic linear problems.
- On sharpness of Tchebycheff-type inequalities
- On the Lambert \(w\) function
- On the exact distribution of linear combinations of order statistics from dependent random variables
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Optimal uncertainty quantification
- Robust optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- The extrema of probability determined by generalized moments. I: Bounded random variables
Cited in
(11)- Tight tail probability bounds for distribution-free decision making
- Distributionally Robust Chance Constrained Geometric Optimization
- Chebyshev's inequality for Hilbert-space-valued random elements
- Notes on the Chernoff product formula
- The Discrete Moment Problem with Nonconvex Shape Constraints
- Games with distributionally robust joint chance constraints
- Distributionally robust optimization. A review on theory and applications
- Optimal bounds and practical insights: Cantelli's inequality revisited
- A probabilistic variant of Chernoff's product formula
- A Gaussian expectation product inequality
- Frameworks and results in distributionally robust optimization
This page was built for publication: Chebyshev inequalities for products of random variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219675)
