Bounding Probability of Small Deviation: A Fourth Moment Approach

In this paper we study the problem of upper bounding the probability that a random variable is above its expected value by a small amount (relative to the expected value), by means of the second and the fourth (central) moments of the random variable. In this particular context, many classical inequalities yield only trivial bounds. We obtain tight upper bounds by studying the primal-dual moments-generating conic optimization problems. As an application, we demonstrate that given the new probability bounds, a substantial sharpening and simplification of a recent result and its analysis by Feige (see Feige, U. 2006. On sums of independent random variables with unbounded variances, and estimating the average degree in a graph. SIAM J. Comput.35 964--984) can be obtained; also, these bounds lead to new properties of the distribution of the cut values for the max-cut problem. We expect the new probability bounds to be useful in many other applications.

[1]  W. J. Studden,et al.  Tchebycheff Systems: With Applications in Analysis and Statistics. , 1967 .

[2]  R. V. Mises.  The Limits of a Distribution Function if Two Expected Values are Given , 1939 .

[3]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[4]  Ioana Popescu,et al.  A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions , 2005, Math. Oper. Res..

[5]  A. Shiryayev.  On Sums of Independent Random Variables , 1992 .

[6]  Uriel Feige,et al.  On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph , 2006, SIAM J. Comput..

[7]  Zhi-Quan Luo,et al.  Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization , 2008, SIAM J. Optim..

[8]  J. Lasserre.  Bounds on measures satisfying moment conditions , 2002 .

[9]  Zhi-Quan Luo,et al.  Semidefnite Relaxation Bounds for Indefinite Homogeneous , 2008 .

[10]  M. Zelen,et al.  Bounds on a distribution function that are functions of moments to order four , 1954 .

[11]  Y. Nesterov.  Structure of non-negative polynomials and optimization problems , 1997 .

[12]  Shankar M. Venkatesan,et al.  Approximation and Intractability Results for the Maximum Cut Problem and its Variants , 1991, IEEE Trans. Computers.

[13]  Bonnie Berger,et al.  The fourth moment method , 1991, SODA '91.

[14]  K. Isii.  The extrema of probability determined by generalized moments (I) bounded random variables , 1960 .

[15]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[16]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[17]  Ioana Popescu,et al.  Optimal Inequalities in Probability Theory: A Convex Optimization Approach , 2005, SIAM J. Optim..

[18]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[19]  James E. Smith,et al.  Generalized Chebychev Inequalities: Theory and Applications in Decision Analysis , 1995, Oper. Res..

[20]  Ioana Popescu,et al.  On the Relation Between Option and Stock Prices: A Convex Optimization Approach , 2002, Oper. Res..