Comptes Rendus
Probability Theory
Bounds on the concentration function in terms of the Diophantine approximation
[Des bornes pour la fonction de concentration en matière d'approximation diophantienne]
Comptes Rendus. Mathématique, Volume 345 (2007) no. 9, pp. 513-518.

Nous montrons un simple raisonnement analytique qui peut être utile pour borner la fonction de concentration d'une somme des variables aléatoires indépendantes. L'application principale est une version de l'inégalité récente de Rudelson et Vershynin, et sa généralisation au cadre multidimensionel.

We demonstrate a simple analytic argument that may be used to bound the Lévy concentration function of a sum of independent random variables. The main application is a version of a recent inequality due to Rudelson and Vershynin, and its multidimensional generalization.

Reçu le :
Accepté le :
Publié le :
DOI : 10.1016/j.crma.2007.10.006
Omer Friedland 1 ; Sasha Sodin 1

1 School of Mathematical Sciences, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel
@article{CRMATH_2007__345_9_513_0,
     author = {Omer Friedland and Sasha Sodin},
     title = {Bounds on the concentration function in terms of the {Diophantine} approximation},
     journal = {Comptes Rendus. Math\'ematique},
     pages = {513--518},
     publisher = {Elsevier},
     volume = {345},
     number = {9},
     year = {2007},
     doi = {10.1016/j.crma.2007.10.006},
     language = {en},
}
TY  - JOUR
AU  - Omer Friedland
AU  - Sasha Sodin
TI  - Bounds on the concentration function in terms of the Diophantine approximation
JO  - Comptes Rendus. Mathématique
PY  - 2007
SP  - 513
EP  - 518
VL  - 345
IS  - 9
PB  - Elsevier
DO  - 10.1016/j.crma.2007.10.006
LA  - en
ID  - CRMATH_2007__345_9_513_0
ER  - 
%0 Journal Article
%A Omer Friedland
%A Sasha Sodin
%T Bounds on the concentration function in terms of the Diophantine approximation
%J Comptes Rendus. Mathématique
%D 2007
%P 513-518
%V 345
%N 9
%I Elsevier
%R 10.1016/j.crma.2007.10.006
%G en
%F CRMATH_2007__345_9_513_0
Omer Friedland; Sasha Sodin. Bounds on the concentration function in terms of the Diophantine approximation. Comptes Rendus. Mathématique, Volume 345 (2007) no. 9, pp. 513-518. doi : 10.1016/j.crma.2007.10.006. https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.1016/j.crma.2007.10.006/

[1] H.J. Brascamp; E.H. Lieb; J.M. Luttinger A general rearrangement inequality for multiple integrals, J. Functional Anal., Volume 17 (1974), pp. 227-237

[2] G. Halász Estimates for the concentration function of combinatorial number theory and probability, Period. Math. Hungar., Volume 8 (1977) no. 3–4, pp. 197-211

[3] R. Howard Estimates on the concentration function in Rd: Notes on Lectures of Oskolkov http://www.math.sc.edu/~howard/Notes/concentration.pdf

[4] M. Rudelson; R. Vershynin The Littlewood–Offord problem and invertibility of random matrices (arxiv preprint) | arXiv

Cité par Sources :

Commentaires - Politique


Ces articles pourraient vous intéresser

Lower estimates for the singular values of random matrices

Mark Rudelson

C. R. Math (2006)


The least singular value of a random square matrix is O(n1/2)

Mark Rudelson; Roman Vershynin

C. R. Math (2008)


Smallest singular value of random matrices with independent columns

Radosław Adamczak; Olivier Guédon; Alexander Litvak; ...

C. R. Math (2008)