Sums of random Hermitian matrices and an inequality by Rudelson

Sidney Golden. “Lower Bounds for the Helmholtz Function.” Physical Review 137, B1127–B1128 (1965)

1965

Earlier work this paper cites.

C.J. Thompson. “Inequality with applications in statistical mechanics.” Journal of Mathematical Physics, 6: 1812-1813 (1965)

1965

Earlier work this paper cites.

Zoltan Füredi and János Komlós. “The eigenvalues of random symmetric matrices.” Combinatorica 1(3), 233-241 (1981)

1981

Earlier work this paper cites.

Michel Ledoux and Michel Talagrand. Probability in Banach Spaces

1991

Earlier work this paper cites.

Françoise Lust-Piquard and Gilles Pisier. “Non commutative Khintchine and Paley inequalities.” Arkiv för Matematik, 29(2): 241-260 (1991)

1991

Earlier work this paper cites.

Mark Rudelson. “Random vectors in the isotropic position.” Journal of Functional Analysis, 164 (1): 60-72 (1999)

1999

Earlier work this paper cites.

Rudolf Ahlswede and Andreas Winter. “Strong converse for identification via quantum channels.” IEEE Transactions on Information Theory 48(3): 569-579 (2002)

2002

Cited alongside, same era.

Zeph Landau and Alexander Russell. “Random Cayley graphs are expanders: a simplified proof of the Alon-Roichman theorem.” The Electronic Journal of Combinatorics, 11(1) (2004)

2004

Cited alongside, same era.

Roman Vershynin. “Frame expansions with erasures: an approach through the non-commutative operator theory.” Applied and Computational Harmonic Analysis 18: 167-176 (2005)

2005

Cited alongside, same era.

Shahar Mendelson and Alain Pajor. “On singular values of matrices with independent rows”. Bernoulli 12(5): 761-773 (2006)

2006

Cited alongside, same era.

Emmanuel Candès and Justin Romberg. “Sparsity and incoherence in compressive sampling.” Inverse Problems 23:969–985 (2007)

Mark Rudelson and Roman Vershynin. “Sampling from large matrices: an approach through geometric functional analysis.” Journal of the ACM 54(4):Article 21 (2007)

2007

Later among the works it cites.

Daniel Spielman and Nikhil Srivastava. “Graph sparsification by effective resistances.” In Proceedings of the 40th annual ACM symposium on Theory of Computing (STOC 2008)

2008

Later among the works it cites.

Joel A. Tropp. “On the conditioning of random subdictionaries.” Applied and Computational Harmonic Analysis 25(1): 1-24 (2008)

2008

Later among the works it cites.

Radoslaw Adamczak, Alexander E. Litvak, Alain Pajor and Nicole Tomczak-Jaegermann.“Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles”. Journal of the American Mathematical Society, to appear (2009)

2009

Later among the works it cites.

Nathan Halko, Per-Gunnar Martinsson and Joel A. Tropp. “Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions.” arXiv:0909.4061 (2009)