On the Kolmogorov-Rogozin inequality for the concentration function
From MaRDI portal
Publication:5517340
DOI10.1007/BF00533057zbMath0142.14702OpenAlexW2072988652MaRDI QIDQ5517340
Publication date: 1966
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00533057
Related Items
Incipient infinite percolation clusters in 2D., On the number of Hadamard matrices via anti-concentration, Singularity of sparse Bernoulli matrices, On the Littlewood-Offord problem, Non-abelian Littlewood-Offord inequalities, On the concentration function of a sum of independent random variables, Level crossing probabilities. I: One-dimensional random walks and symmetrization, Level crossing probabilities. II: Polygonal recurrence of multidimensional random walks, Real zeroes of random polynomials. II: Descartes' rule of signs and anti-concentration on the symmetric group, On delocalization of eigenvectors of random non-Hermitian matrices, Quantitative invertibility of random matrices: a combinatorial perspective, On the Littlewood‐Offord problem for arbitrary distributions, On concentration functions of random variables, Inverse Littlewood-Offord problems and the singularity of random symmetric matrices, Quantitative invertibility of non-Hermitian random matrices, The least singular value of a random symmetric matrix, Local limit theorems for subgraph counts, Almost sure behavior of the critical points of random polynomials, Multivariate estimates for the concentration functions of weighted sums of independent, identically distributed random variables, Anti-concentration Inequalities for Polynomials, Estimates for the concentration functions in the Littlewood-Offord problem, Recurrence of inhomogeneous random walks, RANDOM MATRICES: THE CIRCULAR LAW, Structure of eigenvectors of random regular digraphs, Inverse Littlewood-Offord problems for quasi-norms, Unnamed Item, Bootstrap, wild bootstrap, and asymptotic normality, The Littlewood-Offord problem and invertibility of random matrices, Fonctions de concentration sur certains groupes localement compacts, Optimal query complexity bounds for finding graphs, New applications of Arak's inequalities to the Littlewood-Offord problem, An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs, On the singularity of random symmetric matrices, The smallest singular value of inhomogeneous square random matrices, Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices, Recurrence of multidimensional persistent random walks. Fourier and series criteria, A Combinatorial Approach to Small Ball Inequalities for Sums and Differences, The Littlewood-Offord problem for Markov chains, Smallest singular value of a random rectangular matrix, Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem, On the concentration of additive functions, The circular law for sparse non-Hermitian matrices, On a geometric problem of Erdoes, Sarkoezy, and Szemeredi concerning vector sums, Entropy Inequalities for Sums in Prime Cyclic Groups, The strong circular law: A combinatorial view, Roots of random functions: A framework for local universality
Cites Work
