Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Markus-Spielman-Srivastava inequality for sums of rank-one matrices

Published 30 Jul 2015 in math.PR | (1507.08594v1)

Abstract: We extend the result of Markus, Spielman, and Srivastava about the sum of rank-one symmetric random matrices to the case when the isotropy assumption on the random matrices is relaxed.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up