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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.