Small Ball Probability, Inverse Theorems, and Applications
From MaRDI portal
Publication:5416087
DOI10.1007/978-3-642-39286-3_16zbMath1293.05037arXiv1301.0019OpenAlexW1548847826MaRDI QIDQ5416087
Publication date: 19 May 2014
Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.0019
Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of packing and covering (05B40)
Related Items (46)
Concentration of the number of intersections of random eigenfunctions on flat tori ⋮ On the Littlewood-Offord problem ⋮ Arak's inequalities for concentration functions and the Littlewood-Offord problem ⋮ Non-abelian Littlewood-Offord inequalities ⋮ Nodal set of monochromatic waves satisfying the random wave model ⋮ Singularity of random symmetric matrices revisited ⋮ Probabilistic divide-and-conquer: deterministic second half ⋮ Quantitative invertibility of random matrices: a combinatorial perspective ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ On a Conjecture of Godsil Concerning Controllable Random Graphs ⋮ Anticoncentration and Berry-Esseen bounds for random tensors ⋮ Quantitative invertibility of non-Hermitian random matrices ⋮ The least singular value of a random symmetric matrix ⋮ Tail bounds for sums of independent two-sided exponential random variables ⋮ Entropies of sums of independent gamma random variables ⋮ Anti-concentration Inequalities for Polynomials ⋮ Anti-concentration for polynomials of independent random variables ⋮ Fixed energy universality of Dyson Brownian motion ⋮ Small ball estimates for quasi-norms ⋮ A bound for the maximal probability in the Littlewood-Offord problem ⋮ Inverse Littlewood-Offord problems for quasi-norms ⋮ Random matrices: tail bounds for gaps between eigenvalues ⋮ On a condition number of general random polynomial systems ⋮ New applications of Arak's inequalities to the Littlewood-Offord problem ⋮ Asymptotic zero distribution of random orthogonal polynomials ⋮ SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS ⋮ Toward the history of the Saint St. Petersburg school of probability and statistics. I: Limit theorems for sums of independent random variables ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ On the singularity of random symmetric matrices ⋮ Anti-concentration for subgraph counts in random graphs ⋮ Recent progress in combinatorial random matrix theory ⋮ Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices ⋮ Combinatorial anti-concentration inequalities, with applications ⋮ Roots of random polynomials with coefficients of polynomial growth ⋮ Anticoncentration for subgraph statistics ⋮ A Combinatorial Approach to Small Ball Inequalities for Sums and Differences ⋮ Tail bounds for gaps between eigenvalues of sparse random matrices ⋮ Arak Inequalities for Concentration Functions and the Littlewood--Offord Problem ⋮ Spectrum and pseudospectrum for quadratic polynomials in Ginibre matrices ⋮ Entropy Inequalities for Sums in Prime Cyclic Groups ⋮ Exact minimax risk for linear least squares, and the lower tail of sample covariance matrices ⋮ On the counting problem in inverse Littlewood–Offord theory ⋮ Geometric and o-minimal Littlewood-Offord problems ⋮ The strong circular law: A combinatorial view ⋮ On the concentration of random multilinear forms and the universality of random block matrices ⋮ Roots of random functions: A framework for local universality
This page was built for publication: Small Ball Probability, Inverse Theorems, and Applications
