arXiv Analytics

Sign in

arXiv:1203.6763 [math.PR]AbstractReferencesReviewsResources

Estimates for the concentration functions in the Littlewood--Offord problem

Yulia S. Eliseeva, Friedrich Götze, Andrei Yu. Zaitsev

Published 2012-03-30, updated 2014-11-26Version 3

Let $X,X_1,...,X_n$ be independent identically distributed random variables. In this paper we study the behavior of the concentration functions of the weighted sums $\sum\limits_{k=1}^{n}a_k X_k$ with respect to the arithmetic structure of coefficients $a_k$. Such concentration results recently became important in connection with investigations about singular values of random matrices. In this paper we formulate and prove some refinements of a result of Vershynin (R. Vershynin, Invertibility of symmetric random matrices, arXiv:1102.0300. (2011). Published in Random Structures and Algorithms, v. 44, no. 2, 135--182 (2014)).

Comments: 16 pages
Journal: Zapiski Nauchnykh Seminarov POMI, 2013, vol. 420, p. 50-69
Categories: math.PR
Subjects: 60F05, 60E15, 60G50
Related articles: Most relevant | Search more
arXiv:1506.09034 [math.PR] (Published 2015-06-30)
Arak Inequalities for Concentration Functions and the Littlewood-Offord Problem
arXiv:2112.12574 [math.PR] (Published 2021-12-23, updated 2022-02-07)
A new bound in the Littlewood--Offord problem
arXiv:2304.02268 [math.PR] (Published 2023-04-05)
Improved applications of Arak's inequalities to the Littlewood-Offord problem