Related papers: Interlacing Eigenvectors of Large Gaussian Matrice…
We analyze the rate of convergence of the local statistics of Dyson Brownian motion to the GOE/GUE for short times $t=o(1)$ with deterministic initial data V . Our main result states that if the density of states of $V$ is bounded both…
Non-Hermitian random matrices enjoy non-trivial correlations in the statistics of their eigenvectors. We study the overlap among left and right eigenvectors in Ginibre ensembles with quaternion valued Gaussian matrix elements. This concept…
We consider the Wigner minor process, i.e. the eigenvalues of an $N\times N$ Wigner matrix $H^{(N)}$ together with the eigenvalues of all its $n\times n$ minors, $H^{(n)}$, $n\le N$. The top eigenvalues of $H^{(N)}$ and those of its…
The eigenvalues of the matrix structure $X + X^{(0)}$, where $X$ is a random Gaussian Hermitian matrix and $X^{(0)}$ is non-random or random independent of $X$, are closely related to Dyson Brownian motion. Previous works have shown how an…
We present a five-step method for the calculation of eigenvalue correlation functions for various ensembles of real random matrices, based upon the method of (skew-) orthogonal polynomials. This scheme systematises existing methods and also…
Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to…
The ability to quantify distinctness of a cluster structure is fundamental for certain simulation studies, in particular for those comparing performance of different classification algorithms. The intrinsic integral measure based on the…
The eigenvalues of the Dirac operator on a curved spacetime are diffeomorphism-invariant functions of the geometry. They form an infinite set of ``observables'' for general relativity. Recent work of Chamseddine and Connes suggests that…
We derive the loop equation for the 1-matrix model with generic difference-type measure for eigenvalues and develop a recursive algebraic framework for solving it to an arbitrary order in the coupling constant in and beyond the planar…
We prove the universality of the joint distribution of an eigenvalue and the corresponding diagonal eigenvector overlap, in the bulk and at the edge, for eigenvalues of complex matrices and real eigenvalues of real matrices. As part of the…
We consider quadratic forms of deterministic matrices $A$ evaluated at the random eigenvectors of a large $N \times N$ GOE or GUE matrix, or equivalently evaluated at the columns of a Haar-orthogonal or Haar-unitary random matrix. We prove…
We consider Brownian motion on symmetric matrices of octonions, and study the law of the spectrum. Due to the fact that the octonion algebra is nonassociative, the dimension of the matrices plays a special role. We provide two specific…
In 1962, Dyson introduced dynamics in random matrix models, in particular into GUE (also for beta=1 and 4), by letting the entries evolve according to independent Ornstein-Uhlenbeck processes. Dyson shows the spectral points of the matrix…
Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…
We construct the full edge scaling limit of the singular values of Brownian motion on the general linear group $\mathsf{GL}_N(\mathbb{C})$ starting from general conditions. We show that the limiting paths solve an infinite system of SDE…
The goal of these expository notes is to give an introduction to random matrices for non-specialist of this topic focusing on the link between random matrices and systems of particles in interaction. We first recall some general results…
Following our recent letter, we study in detail an entry-wise diffusion of non-hermitian complex matrices. We obtain an exact partial differential equation (valid for any matrix size $N$ and arbitrary initial conditions) for evolution of…
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…
Diagonalizing a matrix $A$, that is finding two matrices $P$ and $D$ such that $A = PDP^{-1}$ with $D$ being a diagonal matrix needs two steps: first find the eigenvalues and then find the corresponding eigenvectors. We show that we do not…
We propose a general framework to study the stability of the subspace spanned by $P$ consecutive eigenvectors of a generic symmetric matrix ${\bf H}_0$, when a small perturbation is added. This problem is relevant in various contexts,…