Abstract: Let be a random vector in
n, satisfying Bbb E , ens{y} = id. Let be a natural number and let be independent copies of . We prove that for some absolute constant enor{frac{1}{M} sum_i ens{y_i} - id} le C cdot frac{sqrt{log M}}{sqrt{M}} cdot left ( enor{y}^{log M}
ight )^{1/ log M}, provided that the last expression is smaller than 1. We apply this estimate to obtain a new proof of a result of Bourgain concerning the number of random points needed to bring a convex body into a nearly isotropic position.
Recommendations
Cites work
- scientific article; zbMATH DE number 3951374 (Why is no real title available?)
- scientific article; zbMATH DE number 194093 (Why is no real title available?)
- scientific article; zbMATH DE number 1302647 (Why is no real title available?)
- scientific article; zbMATH DE number 4113273 (Why is no real title available?)
- scientific article; zbMATH DE number 3442634 (Why is no real title available?)
- scientific article; zbMATH DE number 775015 (Why is no real title available?)
- scientific article; zbMATH DE number 775034 (Why is no real title available?)
- Almost orthogonal submatrices of an orthogonal matrix
- An Isoperimetric Theorem on the Cube and the Kintchine-Kahane Inequalities
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Contact points of convex bodies
- Non commutative Khintchine and Paley inequalities
- Random walks and anO*(n5) volume algorithm for convex bodies
- Recent developments in non-asymptotic theory of random matrices
- Séries de variables aléatoires vectorielles indépendantes et propriétés géométriques des espaces de Banach
Cited in
(89)- Covariance estimation for distributions with \({2+\varepsilon}\) moments
- Approximating matrices and convex bodies
- Asymptotic shape of a random polytope in a convex body
- On almost randomizing channels with a short Kraus decomposition
- Generalized sampling and infinite-dimensional compressed sensing
- On the conditioning of random subdictionaries
- Extremal overall elastic response of polycrystalline materials
- Column subset selection problem is UG-hard
- The lower tail of random quadratic forms with applications to ordinary least squares
- Relevant sampling of band-limited functions
- Concentration of mass on isotropic convex bodies
- Asymptotic frequentist coverage properties of Bayesian credible sets for sieve priors
- Some new asymptotic theory for least squares series: pointwise and uniform results
- Matrix concentration inequalities and free probability
- Column subset selection via sparse approximation of SVD
- Compressed sensing and matrix completion with constant proportion of corruptions
- Suprema of chaos processes and the restricted isometry property
- Approximation properties of certain operator-induced norms on Hilbert spaces
- The expected norm of a sum of independent random matrices: an elementary approach
- On weakly bounded empirical processes
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Multiscale geometric methods for data sets. I: Multiscale SVD, noise and curvature.
- Approximation of the average of some random matrices
- On generic chaining and the smallest singular value of random matrices with heavy tails
- Spectral norm of products of random and deterministic matrices
- Spectral sparsification in the semi-streaming setting
- Concentration property on probability spaces.
- Majorizing measures and proportional subsets of bounded orthonormal systems
- Frame expansions with erasures: an approach through the non-commutative operator theory
- Concentration phenomena in high dimensional geometry
- Sampling convex bodies: a random matrix approach
- Matrix concentration inequalities via the method of exchangeable pairs
- On the vertex index of convex bodies
- User-friendly tail bounds for sums of random matrices
- Exact matrix completion via convex optimization
- A parallel implementation of an \(O^\ast(n^4)\) volume algorithm
- \(L_{p}\)-moments of random vectors via majorizing measures
- Approximating the moments of marginals of high-dimensional distributions
- Sampling discretization and related problems
- Learning mixtures of separated nonspherical Gaussians
- On some extensions of Bernstein's inequality for self-adjoint operators
- Randomized numerical linear algebra: Foundations and algorithms
- Radial and directional parts of a random vector
- Empirical processes with a bounded \(\psi_1\) diameter
- Convex feasibility modeling and projection methods for sparse signal recovery
- On singular values of matrices with independent rows
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Moment bounds for large autocovariance matrices under dependence
- Random tensor theory: Extending random matrix theory to mixtures of random product states
- An elementary analysis of ridge regression with random design
- How close is the sample covariance matrix to the actual covariance matrix?
- Sampling Hypersurfaces through Diffusion
- Signal recovery and frames that are robust to erasure
- Invertibility of random submatrices via tail-decoupling and a matrix Chernoff inequality
- Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
- Time-uniform, nonparametric, nonasymptotic confidence sequences
- On the linear independence of spikes and sines
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm
- Regularization in kernel learning
- Kahane-Khinchin type averages
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- The Golden-Thompson inequality: historical aspects and random matrix applications
- Breaking the coherence barrier: a new theory for compressed sensing
- A practical volume algorithm
- Universality and sharp matrix concentration inequalities
- Four deviations suffice for rank 1 matrices
- \(L_2\)-norm sampling discretization and recovery of functions from RKHS with finite trace
- Estimating linear functionals of a sparse family of Poisson means
- Nonlinear matrix concentration via semigroup methods
- Some improved bounds in sampling discretization of integral norms
- Marcinkiewicz-type discretization of \(L^p\)-norms under the Nikolskii-type inequality assumption
- Dimension-free bounds for sums of dependent matrices and operators with heavy-tailed distributions
- Graphs, vectors, and matrices
- Time-uniform Chernoff bounds via nonnegative supermartingales
- scientific article; zbMATH DE number 1210319 (Why is no real title available?)
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives
- Sufficient ensemble size for random matrix theory-based handling of singular covariance matrices
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching
- Suboptimality of constrained least squares and improvements via non-linear predictors
- Chaining, interpolation and convexity II: the contraction principle
- Worst-case recovery guarantees for least squares approximation using random samples
- From Poincaré inequalities to nonlinear matrix concentration
- Approximating nonnegative polynomials via spectral sparsification
- Testing Missing at Random Using Instrumental Variables
- On Monte-Carlo methods in convex stochastic optimization
- Fast state tomography with optimal error bounds
- scientific article; zbMATH DE number 1552497 (Why is no real title available?)
- Robust dimension-free Gram operator estimates
- Norms of weighted sums of log-concave random vectors
This page was built for publication: Random vectors in the isotropic position
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294094)
