A comparison principle for functions of a uniformly random subspace
From MaRDI portal
Publication:714948
DOI10.1007/s00440-011-0360-9zbMath1252.60013arXiv1102.0534OpenAlexW2122932035WikidataQ59750699 ScholiaQ59750699MaRDI QIDQ714948
Publication date: 12 October 2012
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.0534
Related Items (3)
Randomized numerical linear algebra: Foundations and algorithms ⋮ Large deviation principles induced by the Stiefel manifold, and random multidimensional projections ⋮ Low-rank matrix recovery via rank one tight frame measurements
Cites Work
- How many entries of a typical orthogonal matrix can be approximated by independent normals?
- Gaussian processes and almost spherical sections of convex bodies
- Maxima of entries of Haar distributed matrices
- Extensions of Lipschitz mappings into a Hilbert space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A comparison principle for functions of a uniformly random subspace
