![Algorithmic Spectral Graph Theory_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Algorithmic%20Spectral%20Graph%20Theory_hi-res.jpg?h=bc58dfd7&itok=8NAdfoPF)
Abstract
The positive semidefinite (psd) rank of a nonnegative real matrix M is the smallest integer k for which it is possible to find psd matrices A_i assigned to the rows of M and B_j assigned to the columns of M, of size k x k, such that (i,j)-entry of M is the inner product of A_i and B_j. This is an example of a cone rank of a nonnegative matrix similar to nonnegative rank, and was introduced for studying sdp-representations of convex sets. I will present the main results and open questions we have so far on psd rank. The talk will be largely based on a recent survey written with Hamza Fawzi, Joao Gouveia, Pablo Parrilo and Richard Robinson.