Sharp Bounds for the Concentration of the Resolvent in Convex Concentration Settings

preprint2022arXivOpen access

Abstract

Considering random matrix X∈Mp,nX \in \mathcal M_{p,n} with independent columns satisfying the convex concentration properties issued from a famous theorem of Talagrand, we express the linear concentration of the resolvent Q=(Ip−1nXXT)−1Q = (I_p - \frac{1}{n}XX^T) ^{-1} around a classical deterministic equivalent with a good observable diameter for the nuclear norm. The general proof relies on a decomposition of the resolvent as a series of powers of XX.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.