Related papers: Solutions of loop equations are random matrices

In this short note, we study the behaviour of a product of matrices with a simultaneous renormalization. Namely, for any sequence $(A\_n)\_{n\in \mathbb{N}}$ of $d\times d$ complex matrices whose mean $A$ exists and whose norms' means are…

For a square matrix, the range of its Rayleigh quotients is known as the numerical range, which is a compact and convex set by the Toeplitz-Hausdorff theorem. The largest value and the smallest boundary value (in magnitude) of this convex…

This paper offers a review of numerical methods for computation of the eigenvalues of Hermitian matrices and the singular values of general and some classes of structured matrices. The focus is on the main principles behind the methods that…

Properties of Hermitian forms are used to investigate several natural questions from CR Geometry. To each Hermitian symmetric polynomial we assign a Hermitian form. We study how the signature pairs of two Hermitian forms behave under the…

We study the eigenvalue spectrum of a large real antisymmetric random matrix $J_{ij}$. Using a fermionic approach and replica trick, we obtain a semicircular spectrum of eigenvalues when the mean value of each matrix element is zero, and in…

We apply random matrix theory to derive spectral density of large sample covariance matrices generated by multivariate VMA(q), VAR(q) and VARMA(q1,q2) processes. In particular, we consider a limit where the number of random variables N and…

A quadrature rule of a measure $\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\mu$ for all polynomials up to some fixed degree. In this…

In general or normal random matrix ensembles, the support of eigenvalues of large size matrices is a planar domain (or several domains) with a sharp boundary. This domain evolves under a change of parameters of the potential and of the size…

We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…

We obtain general upper bounds of the sizes and the numbers of Jordan blocks for the eigenvalues $\lambda \not= 1$ in the monodromies at infinity of polynomial maps.

We consider matrix-valued processes described as solutions to stochastic differential equations of very general form. We study the family of the empirical measure-valued processes constructed from the corresponding eigenvalues. We show that…

The matching problem for a given Jordan curve in the complex plane asks to find two nonconstant functions, one analytic in the bounded complementary component of the curve and the other analytic in the unbounded complementary component of…

This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a…

The singular values of products of standard complex Gaussian random matrices, or sub-blocks of Haar distributed unitary matrices, have the property that their probability distribution has an explicit, structured form referred to as a…

We define a class of "algebraic" random matrices. These are random matrices for which the Stieltjes transform of the limiting eigenvalue distribution function is algebraic, i.e., it satisfies a (bivariate) polynomial equation. The Wigner…

Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour random walk on G. We give a new proof of the fact that the…

Eigensolvers involving complex moments can determine all the eigenvalues in a given region in the complex plane and the corresponding eigenvectors of a regular linear matrix pencil. The complex moment acts as a filter for extracting…

An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…

We prove that the local eigenvalue statistics in the bulk for complex random matrices with independent entries whose $r$-th absolute moment decays as $N^{-1-(r-2)\epsilon}$ for some $\epsilon>0$ are universal. This includes sparse matrices…

In this paper we study para-Hermitian rational matrices and the associated structured rational eigenvalue problem (REP). Para-Hermitian rational matrices are square rational matrices that are Hermitian for all $z$ on the unit circle that…