Recent developments in non-asymptotic theory of random matrices

zbMath1310.15075arXiv1301.2382MaRDI QIDQ5178622

M. V. Rudel'son

Publication date: 16 March 2015

Full work available at URL: https://arxiv.org/abs/1301.2382

zbMATH Keywords

algorithmsconvergencerandom matricesprobability bounds

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52)

Related Items

L^p and almost sure rates of convergence of averaged stochastic gradient algorithms: locally strongly convex objective ⋮ On the smallest singular value of symmetric random matrices ⋮ Singularity of sparse Bernoulli matrices ⋮ A remark on the smallest singular value of powers of Gaussian matrices ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ The smallest singular value of a shifted random matrix ⋮ On the smoothed analysis of the smallest singular value with discrete noise ⋮ Complex random matrices have no real eigenvalues ⋮ The cylindrical width of transitive sets ⋮ Invertibility of sparse non-Hermitian matrices ⋮ No-gaps delocalization for general random matrices ⋮ Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices ⋮ Random vectors in the isotropic position ⋮ Rank deficiency of random matrices