Related papers: New scaling of Itzykson-Zuber integrals

We show that sufficiently low tensor rank for the balanced tripartitioning tensor $P_d(x,y,z)=\sum_{A,B,C\in\binom{[3d]}{d}:A\cup B\cup C=[3d]}x_Ay_Bz_C$ for a large enough constant $d$ implies uniform arithmetic circuits for the matrix…

We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…

We study the asymptotic behavior of outliers in the spectrum of bounded rank perturbations of large random matrices. In particular, we consider perturbations of elliptic random matrices which generalize both Wigner random matrices and…

We prove that the 2-hermitean matrix model and the complex-matrix model obey the same loop equations, and as a byproduct, we find a formula for Itzykzon-Zuber's type integrals over the unitary group. Integrals over U(n) are rewritten as…

Low-rank matrix completion concerns the problem of estimating unobserved entries in a matrix using a sparse set of observed entries. We consider the non-uniform setting where the observed entries are sampled with highly varying…

We propose a new algorithm to solve optimization problems of the form $\min f(X)$ for a smooth function $f$ under the constraints that $X$ is positive semidefinite and the diagonal blocks of $X$ are small identity matrices. Such problems…

We revisit the work of the first named author and using simpler algebraic arguments we calculate integrals of polynomial functions with respect to the Haar measure on the unitary group U(d). The previous result provided exact formulas only…

Suppose that we observe entries or, more generally, linear combinations of entries of an unknown $m\times T$-matrix $A$ corrupted by noise. We are particularly interested in the high-dimensional setting where the number $mT$ of unknown…

Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing com plexity. Recently, fast and reliable eigensolvers dealing with low…

We study the Riemannian optimization methods on the embedded manifold of low rank matrices for the problem of matrix completion, which is about recovering a low rank matrix from its partial entries. Assume $m$ entries of an $n\times n$ rank…

We introduce and study isomonodromy transformations of the matrix linear difference equation Y(z+1)=A(z)Y(z) with polynomial (or rational) A(z). Our main result is a construction of an isomonodromy action of Z^{m(n+1)-1} on the space of…

In this paper, we study the asymptotic nonnegative rank of matrices, which characterizes the asymptotic growth of the nonnegative rank of fixed nonnegative matrices under the Kronecker product. This quantity is important since it governs…

We study the asymptotic rank of adjacency matrices of a large class of edge-weighted configuration models. Here, the weight of a (multi-)edge can be any fixed non-zero element from an arbitrary field, as long as it is independent of the…

The HarishChandra-Itzykson-Zuber integral over the unitary group U(k) (beta=2) is present in numerous problems involving Hermitian random matrices. It is well known that the result is semi-classically exact. This simple result does not…

We consider the problem of determining rank loss conditions for a concatenation of full-rank matrices, such that each row of the composing matrices is scaled by a random coefficient. This problem has applications in wireless interference…

The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…

The problem of approximating a matrix by a low-rank one has been extensively studied. This problem assumes, however, that the whole matrix has a low-rank structure. This assumption is often false for real-world matrices. We consider the…

We generalize Harish-Chandra-Itzykson-Zuber and certain other integrals (Gross-Witten integral and integrals over complex matrices) using the notion of tau function of matrix argument. In this case one can reduce the matrix integral to the…

Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the…

This paper studies the inference about linear functionals of high-dimensional low-rank matrices. While most existing inference methods would require consistent estimation of the true rank, our procedure is robust to rank misspecification,…