Local operator theory, random matrices and Banach spaces.
This paper surveys some highlights of the connection between Banach space theory on the one hand and random matrices and local operator theory on the other. The last topic pertains to aspects of operator theory which reduce to the study of the asymptotic behaviour of parameters associated with finite matrices. The connection between Banach spaces and the other two topics is sometimes by application of one of the fields to solve problems in the other and sometimes by analogies and transfer of methods. The paper is divided into two parts. The first deals with local operator theory; among the subjects discussed are: 1. Discussion of the problem (solved affirmatively by \textit{H.-X. Lin} [Fields Inst. Commun. 13, 193--233 (1997; Zbl 0881.46042)]) of whether the smallness of the commutant of two Hermitian matrices implies that they are close to a commuting pair of matrices. 2. When and in what sense is it true that if two matrices are close together then their spectra are close together as well. 3. The paving problem: Given \(\varepsilon>0\), is there a \(k\) such that for all matrices \(T\) of norm one (as an operator from \(\ell_2^n\) to itself) and with diagonal zero, so one can find a decomposition of the canonical basis into \(k\) subsets such that \(\sum P_iTP_i\) is at most \(\varepsilon\), where \(P_i\) is the orthogonal projection onto the span of the \(i\)-s subset? This problem is still open. \textit{J. Bourgain} and \textit{L. Tzafriri} [J. Reine Angew. Math. 420, 1--43 (1991; Zbl 0729.47028)] have some highly nontrivial results in this direction. The second part deals with some topics involving random matrices: Estimates of the asymptotic distribution of the norm and of the spectrum of some ensembles of random matrices, including discussions on the Wigner semicircle law, deviation inequalities for the singular values of a Gaussian matrix, the Slepian--Gordon lemma and its application for estimating norms of Gaussian matrices. There is also a section on the connection between random matrices and free probability. Some corrections and additions to this paper appear in Vol. 2 of the same handbook. For the entire collection see [Zbl 0970.46001].
- Finite sample approximation results for principal component analysis: A matrix perturbation approach
- Lasso-type recovery of sparse representations for high-dimensional data
- Consistency of restricted maximum likelihood estimators of principal components
- High dimensional random sections of isotropic convex bodies
- Nearly unbiased variable selection under minimax concave penalty
- Latent variable graphical model selection via convex optimization
- Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization
- PROMP: a sparse recovery approach to lattice-valued signals
- On the Banach-Mazur distance to cross-polytope
- Canonical correlation coefficients of high-dimensional Gaussian vectors: finite rank case
- Learning semidefinite regularizers
- Detecting Markov random fields hidden in white noise
- Random Laplacian matrices and convex relaxations
- Saturating constructions for normed spaces. II
- Robust covariance and scatter matrix estimation under Huber's contamination model
- On the concentration of eigenvalues of random symmetric matrices
- Concentration of norms and eigenvalues of random matrices
- The convex geometry of linear inverse problems
- Compressed sensing and matrix completion with constant proportion of corruptions
- Randomized preprocessing versus pivoting
- Discussion: Latent variable graphical model selection via convex optimization
- Rejoinder: Latent variable graphical model selection via convex optimization
- Adaptive covariance matrix estimation through block thresholding
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons
- Group symmetry and covariance regularization
- Estimating networks with jumps
- Blockwise SVD with error in the operator and application to blind deconvolution
- Estimation of Gaussian graphs by model selection
- Theoretical properties of Cook's PFC dimension reduction algorithm for linear regression
- Detection boundary in sparse regression
- Low rank multivariate regression
- On concentration of empirical measures and convergence to the semi-circle law
- Hyperreflexivity of the space of module homomorphisms between non-commutative \(L^p\)-spaces
- The spectral norm of random lifts of matrices
- On the robustness of minimum norm interpolators and regularized empirical risk minimizers
- Asymptotic normality of robust M-estimators with convex penalty
- Minimax rate of testing in sparse linear regression
- Phase retrieval using alternating minimization in a batch setting
- Robust sparse covariance estimation by thresholding Tyler's M-estimator
- Statistical and computational limits for sparse matrix detection
- TAP free energy, spin glasses and variational inference
- An efficient numerical method for condition number constrained covariance matrix approximation
- Saving phase: injectivity and stability for phase retrieval
- A global homogeneity test for high-dimensional linear regression
- Erasure recovery matrices for encoder protection
- On the strong restricted isometry property of Bernoulli random matrices
- Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case
- Optimal estimation and rank detection for sparse spiked covariance matrices
- Preconditioning the Lasso for sign consistency
- Sparse learning via Boolean relaxations
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Robust computation of linear models by convex relaxation
- Numerically safe Gaussian elimination with no pivoting
- Average-case complexity without the black swans
- Diameters of sections and coverings of convex bodies
- Hypothesis testing for regional quantiles
- Entanglement, quantum randomness, and complexity beyond scrambling
- Support union recovery in high-dimensional multivariate regression
- Nonlinear estimation for linear inverse problems with error in the operator
- The Littlewood-Offord problem and invertibility of random matrices
- Operator spaces with prescribed sets of completely bounded maps
- Smallest singular value of random matrices and geometry of random polytopes
- Quantum expanders and geometry of operator spaces
- Instrumental variables estimation with many weak instruments using regularized JIVE
- Counterexamples to the maximal \(p\)-norm multiplicativity conjecture for all \(p>1\)
- Almost commuting self-adjoint matrices: the real and self-dual cases
- On the Limiting Shape of Young Diagrams Associated with Inhomogeneous Random Words
- Marčenko-Pastur law for Tyler's M-estimator
- Dichotomy theorems for random matrices and closed ideals of operators on \((\bigoplus _{n=1}^{\infty }\ell _{1}^{n})_{c_o}\)
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Reduced-rank estimation for ill-conditioned stochastic linear model with high signal-to-noise ratio
- Bernstein-von Mises theorems for functionals of the covariance matrix
- Frames and the Feichtinger conjecture
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Approximation by matrices with simple spectra
- New studies of randomized augmentation and additive preprocessing
- Sampling convex bodies: a random matrix approach
- Distance to normal elements in C^-algebras of real rank zero
- Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
- On the effect of noisy measurements of the regressor in functional linear models
- Minimax bounds for sparse PCA with noisy high-dimensional data
- Simple bounds for recovering low-complexity models
- Application of second generation wavelets to blind spherical deconvolution
- Correlated variables in regression: clustering and sparse estimation
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- Numerically erasure-robust frames
- Solving linear systems of equations with randomization, augmentation and aggregation
- An analytic study of the reversal of Hartmann flows by rotating magnetic fields
- Improved bounds for small-sample estimation
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Iterated learning in dynamic social networks
- Self-Sustaining Iterated Learning
- The road to deterministic matrices with the restricted isometry property
- Numerical range for random matrices
- Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
- Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- Sublinear Cost Low Rank Approximation via Subspace Sampling
- Graph-based regularization for regression problems with alignment and highly correlated designs
- Twice is enough for dangerous eigenvalues
This page was built for publication: Local operator theory, random matrices and Banach spaces.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760174)