Bounds on the concentration function in terms of the Diophantine approximation
From MaRDI portal
Publication:2464263
DOI10.1016/j.crma.2007.10.006zbMath1138.60023arXiv0706.2679MaRDI QIDQ2464263
Publication date: 12 December 2007
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0706.2679
60E15: Inequalities; stochastic orderings
11K60: Diophantine approximation in probabilistic number theory
Related Items
Complex random matrices have no real eigenvalues, A Combinatorial Approach to Small Ball Inequalities for Sums and Differences, Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem, On the Littlewood-Offord problem, Small ball estimates for quasi-norms, Inverse Littlewood-Offord problems for quasi-norms, Random embedding of \({\ell_p^n}\) into \({\ell_r^N}\), Multivariate estimates for the concentration functions of weighted sums of independent, identically distributed random variables, Estimates for the concentration functions in the Littlewood-Offord problem, On the rate of decay of concentration functions of \(n\)-fold convolutions of probability distributions, Toward the history of the Saint St. Petersburg school of probability and statistics. I: Limit theorems for sums of independent random variables, Exit times for integrated random walks, Smallest singular value of a random rectangular matrix
Cites Work
