Probability inequalities for convex sets and multidimensional concentration functions
This paper derives a sharp bound for the probability that a sum of independent symmetric random vectors lies in a symmetric convex set. In one dimension this bound is an improvement of an inequality first proved by Kolmogorov. The subject of multidimensional concentration functions is also treated.
Volume (Year): 6 (1976)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jmvana:v:6:y:1976:i:2:p:222-236. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.