A tight upper bound for the expectation of a convex function of a multivariate random variable

1986 ◽  
pp. 39-53 ◽  
Author(s):  
H. Gassmann ◽  
W. T. Ziemba
Keyword(s):  
Convex Function ◽  
Upper Bound ◽  
Random Variable

A MEAN–VARIANCE BOUND FOR A THREE-PIECE LINEAR FUNCTION

2007 ◽  
Vol 21 (4) ◽  
pp. 611-621 ◽  
Author(s):  
Karthik Natarajan ◽  
Zhou Linyi
Keyword(s):  
Convex Function ◽  
Closed Form ◽  
Linear Function ◽  
Upper Bound ◽  
Random Variable ◽  
Expected Value ◽  
Variance Bound ◽  
The Mean ◽  
Mean Variance

In this article, we derive a tight closed-form upper bound on the expected value of a three-piece linear convex function E[max(0, X, mX − z)] given the mean μ and the variance σ2 of the random variable X. The bound is an extension of the well-known mean–variance bound for E[max(0, X)]. An application of the bound to price the strangle option in finance is provided.

More bounds on the expectation of a convex function of a random variable

1972 ◽  
Vol 9 (4) ◽  
pp. 803-812 ◽  
Author(s):  
Ben-Tal A. ◽  
E. Hochman
Keyword(s):  
Convex Function ◽  
Upper Bound ◽  
Random Variable ◽  
Independent Random Variables ◽  
Multivariate Distributions ◽  
Absolute Deviation ◽  
Additional Information ◽  
Wait And See ◽  
The Mean ◽  
Moment Spaces

Jensen gave a lower bound to Eρ(T), where ρ is a convex function of the random vector T. Madansky has obtained an upper bound via the theory of moment spaces of multivariate distributions. In particular, Madansky's upper bound is given explicitly when the components of T are independent random variables. For this case, lower and upper bounds are obtained in the paper, which uses additional information on T rather than its mean (mainly its expected absolute deviation about the mean) and hence gets closer to Eρ(T).The importance of having improved bounds is illustrated through a nonlinear programming problem with stochastic objective function, known as the “wait and see” problem.

More bounds on the expectation of a convex function of a random variable

1972 ◽  
Vol 9 (04) ◽  
pp. 803-812 ◽  
Author(s):  
Ben-Tal A. ◽  
E. Hochman
Keyword(s):  
Convex Function ◽  
Upper Bound ◽  
Random Variable ◽  
Independent Random Variables ◽  
Multivariate Distributions ◽  
Absolute Deviation ◽  
Additional Information ◽  
Wait And See ◽  
The Mean ◽  
Moment Spaces

Jensen gave a lower bound to Eρ(T), where ρ is a convex function of the random vector T. Madansky has obtained an upper bound via the theory of moment spaces of multivariate distributions. In particular, Madansky's upper bound is given explicitly when the components of T are independent random variables. For this case, lower and upper bounds are obtained in the paper, which uses additional information on T rather than its mean (mainly its expected absolute deviation about the mean) and hence gets closer to Eρ(T). The importance of having improved bounds is illustrated through a nonlinear programming problem with stochastic objective function, known as the “wait and see” problem.

Poisson approximation for a sum of dependent indicators: an alternative approach

2002 ◽  
Vol 34 (03) ◽  
pp. 609-625 ◽  
Author(s):  
N. Papadatos ◽  
V. Papathanasiou
Keyword(s):  
Total Variation ◽  
Upper Bound ◽  
Random Variables ◽  
Random Variable ◽  
Poisson Approximation ◽  
Total Variation Distance ◽  
Poisson Random Variable ◽  
Birthday Problem ◽  
Alternative Approach ◽  
Variation Distance

The random variablesX1,X2, …,Xnare said to be totally negatively dependent (TND) if and only if the random variablesXiand ∑j≠iXjare negatively quadrant dependent for alli. Our main result provides, for TND 0-1 indicatorsX1,x2, …,Xnwith P[Xi= 1] =pi= 1 - P[Xi= 0], an upper bound for the total variation distance between ∑ni=1Xiand a Poisson random variable with mean λ ≥ ∑ni=1pi. An application to a generalized birthday problem is considered and, moreover, some related results concerning the existence of monotone couplings are discussed.

Poisson approximation for (k1, k2)-events via the Stein-Chen method

2004 ◽  
Vol 41 (4) ◽  
pp. 1081-1092 ◽  
Author(s):  
P. Vellaisamy
Keyword(s):  
Limit Theorem ◽  
Rate Of Convergence ◽  
Upper Bound ◽  
Success Probability ◽  
Random Variable ◽  
Poisson Approximation ◽  
Bernoulli Trials ◽  
Poisson Random Variable ◽  
Markov Dependent Trials ◽  
Special Case

Consider a sequence of independent Bernoulli trials with success probability p. Let N(n; k1, k2) denote the number of times that k1 failures are followed by k2 successes among the first n Bernoulli trials. We employ the Stein-Chen method to obtain a total variation upper bound for the rate of convergence of N(n; k1, k2) to a suitable Poisson random variable. As a special case, the corresponding limit theorem is established. Similar results are obtained for Nk3(n; k1, k2), the number of times that k1 failures followed by k2 successes occur k3 times successively in n Bernoulli trials. The bounds obtained are generally sharper than, and improve upon, some of the already known results. Finally, the technique is adapted to obtain Poisson approximation results for the occurrences of the above-mentioned events under Markov-dependent trials.

Poisson approximation for a sum of dependent indicators: an alternative approach

2002 ◽  
Vol 34 (3) ◽  
pp. 609-625 ◽  
Author(s):  
N. Papadatos ◽  
V. Papathanasiou
Keyword(s):  
Total Variation ◽  
Upper Bound ◽  
Random Variables ◽  
Random Variable ◽  
Poisson Approximation ◽  
Total Variation Distance ◽  
Poisson Random Variable ◽  
Birthday Problem ◽  
Alternative Approach ◽  
Variation Distance

The random variables X1, X2, …, Xn are said to be totally negatively dependent (TND) if and only if the random variables Xi and ∑j≠iXj are negatively quadrant dependent for all i. Our main result provides, for TND 0-1 indicators X1, x2, …, Xn with P[Xi = 1] = pi = 1 - P[Xi = 0], an upper bound for the total variation distance between ∑ni=1Xi and a Poisson random variable with mean λ ≥ ∑ni=1pi. An application to a generalized birthday problem is considered and, moreover, some related results concerning the existence of monotone couplings are discussed.

On measures of non-degeneracy

1992 ◽  
Vol 29 (3) ◽  
pp. 733-739
Author(s):  
K. B. Athreya
Keyword(s):  
Convex Function ◽  
Branching Processes ◽  
Jensen’S Inequality ◽  
Random Variable ◽  
Jensen's Inequality ◽  
Unique Role

If φ is a convex function and X a random variable then (by Jensen's inequality) ψ φ (X) = Eφ (X) – φ (EX) is non-negative and 0 iff either φ is linear in the range of X or X is degenerate. So if φ is not linear then ψ φ (X) is a measure of non-degeneracy of the random variable X. For φ (x) = x2, ψ φ (X) is simply the variance V(X) which is additive in the sense that V(X + Y) = V(X) + V(Y) if X and Y are uncorrelated. In this note it is shown that if φ ″(·) is monotone non-increasing then ψ φ is sub-additive for all (X, Y) such that EX ≧ 0, P(Y ≧ 0) = 1 and E(X | Y) = EX w.p.l, and is additive essentially only if φ is quadratic. Thus, it confirms the unique role of variance as a measure of non-degeneracy. An application to branching processes is also given.

scholarly journals On Tails of Perpetuities

2010 ◽  
Vol 47 (4) ◽  
pp. 1191-1194 ◽  
Author(s):  
Paweł Hitczenko
Keyword(s):  
Lower Bound ◽  
Difference Equation ◽  
Upper Bound ◽  
Random Variable ◽  
Stochastic Difference Equation

We establish an upper bound on the tails of a random variable that arises as a solution of a stochastic difference equation. In the nonnegative case our bound is similar to a lower bound obtained in Goldie and Grübel (1996).

scholarly journals Hermite-Hadamard, Jensen, and Fractional Integral Inequalities for Generalized P -Convex Stochastic Processes

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Fangfang Ma ◽  
Waqas Nazeer ◽  
Mamoona Ghafoor
Keyword(s):  
Probability Theory ◽  
Convex Function ◽  
Stochastic Processes ◽  
Fractional Integral ◽  
Probabilistic Models ◽  
Random Variable ◽  
Expected Value ◽  
Integral Inequalities ◽  
Stochastic Convexity ◽  
Convex Stochastic Processes

The stochastic process is one of the important branches of probability theory which deals with probabilistic models that evolve over time. It starts with probability postulates and includes a captivating arrangement of conclusions from those postulates. In probability theory, a convex function applied on the expected value of a random variable is always bounded above by the expected value of the convex function of that random variable. The purpose of this note is to introduce the class of generalized p -convex stochastic processes. Some well-known results of generalized p -convex functions such as Hermite-Hadamard, Jensen, and fractional integral inequalities are extended for generalized p -stochastic convexity.

Sign in / Sign up

Export Citation Format

Share Document