2008 | OriginalPaper | Buchkapitel
Decoupling and Partial Independence
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The initial motivation of this note was the question: How many samples are needed to approximate the inertia matrix (variance-covariance matrix) of a density on
R
n
? It first arose in a joint paper with L. Lovász and M. Simonovits on an algorithm for computing volumes of convex sets. Rudelson proved a very interesting result (answering the question) based on a classical theorem from Functional Analysis (see Square Form Theorem below) due to Lust-Piquard, which is proved using the beautiful technique of Decoupling. This note gives a self-contained proof of the theorem and its application to this problem as well as a different question dealing with extending the basic result of Random Matrix Theory to partially random matrices (see Theorem 3) below.