Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem
From MaRDI portal
Publication:5242511
DOI10.1137/S0040585X97T988563zbMath1461.60016arXiv1506.09034OpenAlexW2803967590WikidataQ129808524 ScholiaQ129808524MaRDI QIDQ5242511
Friedrich Götze, Yu. S. Eliseeva, Andrei Yu. Zaitsev
Publication date: 12 November 2019
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.09034
Inequalities; stochastic orderings (60E15) Sums of independent random variables; random walks (60G50)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation methods in probability theory
- On the Littlewood-Offord problem
- A bound for the maximal probability in the Littlewood-Offord problem
- Optimal inverse Littlewood-Offord theorems
- 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
- Approximation with accompanying distributions and asymptotic expansions. I
- Multidimensional generalized method of triangular functions
- John-type theorems for generalized arithmetic progressions and iterated sumsets
- Estimates for the closeness of successive convolutions of multidimensional symmetric distributions
- Certain class of nonuniform estimates in multidimensional limit theorems
- Approximation of convolutions of probability distributions by infinitely divisible laws under weakened moment restrictions
- Estimates for the rapid decay of concentration functions of \(n\)-fold convolutions
- Approximation of convolutions of multi-dimensional symmetric distributions by accompanying laws
- Bounds on the maximum of the density for sums of independent random variables
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Bounds on the concentration function in terms of the Diophantine approximation
- The Littlewood-Offord problem and invertibility of random matrices
- On the measure of large values of the modulus of a trigonometric sum
- Approximation of a sample by a Poisson point process
- Estimates of the Concentration Functions of Weighted Sums of Independent Random Variables
- A sharp inverse Littlewood-Offord theorem
- Two Uniform Limit Theorems for Sums of Independent Random Variables
- On the Rate of Convergence in Kolmogorov’s Second Uniform Limit Theorem
- On the Accuracy of Approximation of Distributions of Sums of Independent Random Variables—Which are Nonzero with a Small Probability—By Means of Accompanying Laws
- Small Ball Probabilities for Linear Images of High-Dimensional Distributions
- Smallest singular value of a random rectangular matrix
- On the Uniform Approximation of Distributions of Sums of Independent Random Variables
- On the Approximation of n-Fold Convolutions of Distributions having Non-Negative Characteristic Functions with Accompanying Laws
- On the Convergence Rate in Kolmogorov’s Uniform Limit Theorem. I
- Structure Theory of Set Addition and Local Limit Theorems for Independent Lattice Random Variables
- Estimates for the concentration function of combinatorial number theory and probability
- A multiplicative inequality for concentration functions of $n$-fold convolutions
- Multidimensional Version of the Second Uniform Limit Theorem of Kolmogorov
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
- Invertibility of symmetric random matrices
- Small Ball Probability, Inverse Theorems, and Applications
- On the Kolmogorov-Rogozin inequality for the concentration function
- On the concentration function of a sum of independent random variables
- On a lemma of Littlewood and Offord
- On bounds for the concentration function. II
This page was built for publication: Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem
