arXiv:1402.6966 [math.PR]AbstractReferencesReviewsResources
A multiplicative inequality for concentration functions of $n$-fold convolutions
Published 2014-02-27Version 1
We estimate the concentration functions of $n$-fold convolutions of one-dimensional probability measures. The main result is a supplement to the results of G\"otze and Zaitsev (1998). We show that the estimation of concentration functions at arguments of bounded size can be reduced to the estimation of these functions at arguments of size $O(\sqrt n)$ which is easier.
Journal: High dimensional probability II, Progress in Probability, vol. 47, eds. E. Gin\'e, D. Mason, J. Wellner, Birkh\"auser, Boston-Basel-Berlin, 2000, 39--47
Categories: math.PR
Subjects: 60F05
Keywords: concentration functions, fold convolutions, multiplicative inequality, one-dimensional probability measures, estimation
Tags: journal article
Related articles: Most relevant | Search more
Estimates for the concentration functions in the Littlewood--Offord problem
arXiv:1511.03830 [math.PR] (Published 2015-11-12)
Estimation of entropy for Poisson marked point processes
arXiv:1608.03001 [math.PR] (Published 2016-08-09)
Bounds for the concentration functions of random sums under relaxed moment conditions