Comparison theorems for the minimum eigenvalue of a random positive-semidefinite matrix
From MaRDI portal
Cites work
- Alice and Bob Meet Banach
- An introduction to finite tight frames
- An introduction to matrix concentration inequalities
- Asymptotic Statistics
- Bernstein functions. Theory and applications
- Bounding the smallest singular value of a random matrix without concentration
- Concentration inequalities. A nonasymptotic theory of independence
- Covariance estimation for distributions with \({2+\varepsilon}\) moments
- Dimension-free bounds for sums of independent matrices and simple tensors via the variational principle
- Equivalent forms of the Bessis-Moussa-Villani conjecture
- Extreme singular values of inhomogeneous sparse random rectangular matrices
- Fast state tomography with optimal error bounds
- Fundamentals of Stein's method
- Gaussian measures of dilatations of convex symmetric sets
- Herbert Stahl's proof of the BMV conjecture
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 3886886 (Why is no real title available?)
- scientific article; zbMATH DE number 5131267 (Why is no real title available?)
- scientific article; zbMATH DE number 6026126 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- scientific article; zbMATH DE number 3108056 (Why is no real title available?)
- Improved approximation algorithms for large matrices via random projections
- Limit of the smallest eigenvalue of a large dimensional sample covariance matrix
- Low rank approximation and regression in input sparsity time
- Matrix concentration inequalities and free probability
- Monotonic converging variational approximations to the functional integrals in quantum statistical mechanics
- Nearly tight oblivious subspace embeddings by trace inequalities
- Normal Approximation by Stein’s Method
- Normal approximations with Malliavin calculus. From Stein's method to universality
- On the Medians of Gamma Distributions and an Equation of Ramanujan
- On the non-asymptotic concentration of heteroskedastic Wishart-type matrix
- Optimal subspace embeddings: resolving Nelson-nguyen conjecture up to sub-polylogarithmic factors
- OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Proof of the BMV conjecture
- Random vectors in the isotropic position
- Randomized numerical linear algebra: Foundations and algorithms
- Real Analysis and Probability
- Robust linear least squares regression
- Sample Covariance Matrices of Heavy-Tailed Distributions
- Second-order matrix concentration inequalities
- Simplified PAC-Bayesian margin bounds.
- Sketching as a tool for numerical linear algebra
- Stahl's theorem (aka BMV conjecture): insights and intuition on its proof
- Stein's method for concentration inequalities
- Streaming low-rank matrix approximation with an application to scientific simulation
- The lower tail of random quadratic forms with applications to ordinary least squares
- Toward a unified theory of sparse dimensionality reduction in Euclidean space
- Trace inequalities and quantum entropy: an introductory course
- Tracial joint spectral measures
- Twice-Ramanujan sparsifiers
- Une inegalité du type de Slepian et Gordon sur les processus gaussiens. (An inequality of Slepian and Gordon type for Gaussian processes)
- Universality and sharp matrix concentration inequalities
- Universality laws for randomized dimension reduction, with applications
- Upper and lower bounds for stochastic processes. Decomposition theorems
This page was built for publication: Comparison theorems for the minimum eigenvalue of a random positive-semidefinite matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307936)
