pith. sign in

arxiv: 1305.5646 · v1 · pith:4BEYZSRMnew · submitted 2013-05-24 · 🧮 math.ST · stat.TH

A simple proof for the multivariate Chebyshev inequality

classification 🧮 math.ST stat.TH
keywords inequalityproofchebyshevmeanobtainedrandomsimplearbitrary
0
0 comments X
read the original abstract

In this paper a simple proof of the Chebyshev's inequality for random vectors obtained by Chen (arXiv:0707.0805v2, 2011) is obtained. This inequality gives a lower bound for the percentage of the population of an arbitrary random vector X with finite mean E(X) and a positive definite covariance matrix V=Cov(X) whose Mahalanobis distance with respect to V to the mean E(X) is less than a fixed value. The proof is based on the calculation of the principal components.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.