Related papers: On collision of multiple eigenvalues for matrix-va…
The complex eigenvalues of some non-Hermitian Hamiltonians, e.g. parity-time symmetric Hamiltonians, come in complex-conjugate pairs. We show that for non-Hermitian scattering Hamiltonians (of a structureless particle in one dimension)…
An important consideration for variable selection in interaction models is to design an appropriate penalty that respects hierarchy of the importance of the variables. A common theme is to include an interaction term only after the…
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…
Statistical properties of eigenvectors in non-Hermitian random matrix ensembles are discussed, with an emphasis on correlations between left and right eigenvectors. Two approaches are described. One is an exact calculation for Ginibre's…
We review the ideas of how random matrix theory has to be properly applied to quantum physics; particularly we focus on how the spectrum has to be properly prepared and the random matrix correctly identified before the random matrix and the…
We consider the random matrix ensemble with an external source \[ \frac{1}{Z_n} e^{-n \Tr({1/2}M^2 -AM)} dM \] defined on $n\times n$ Hermitian matrices, where $A$ is a diagonal matrix with only two eigenvalues $\pm a$ of equal…
We prove a large deviation result for a random symmetric n x n matrix with independent identically distributed entries to have a few eigenvalues of size n. If the spectrum S survives when the matrix is rescaled by a factor of n, it can only…
We consider level crossing in a matrix family $H=H_0+\lambda V$ where $H_0$ is a fixed $N\times N$ matrix and $V$ belongs to one of the standard Gaussian random matrix ensembles. We study the probability distribution of level crossing…
Quadratic variations of Gaussian processes play important role in both stochastic analysis and in applications such as estimation of model parameters, and for this reason the topic has been extensively studied in the literature. In this…
We examine the asymptotics of the moments of characteristic polynomials of $N\times N$ matrices drawn from the Hermitian ensembles of Random Matrix Theory, in the limit as $N\to\infty$. We focus in particular on the Gaussian Unitary…
Let $X=\{X(t),t\in\mathbb{R}^N\}$ be a random field with values in $\mathbb{R}^d$. For any finite Borel measure $\mu$ and analytic set $E\subset\mathbb{R}^N$, the Hausdorff and packing dimensions of the image measure $\mu_X$ and image set…
We uncover a hidden Gaussian ensemble inside each of the three circular ensembles of random matrices, which provide novel diagrammatic rules for the calculation of moments. The matrices involved are generic complex for $\beta=2$, complex…
We prove a Hausdorff dimension result for the image of two-dimensional multiplicative cascade processes, and we obtain from this result a KPZ-type formula which normally has one point of phase transition.
We establish a new connection between moments of $n \times n$ random matrices $X_n$ and hypergeometric orthogonal polynomials. Specifically, we consider moments $\mathbb{E}\mathrm{Tr} X_n^{-s}$ as a function of the complex variable $s \in…
A simple iterative scheme is proposed for locating the parameter values for which a 2-parameter family of real symmetric matrices has a double eigenvalue. The convergence is proved to be quadratic. An extension of the scheme to complex…
The set of badly approximable $m \times n $ matrices is known to have Hausdorff dimension $mn $. Each such matrix comes with its own approximation constant $c$, and one can ask for the dimension of the set of badly approximable matrices…
We prove that the point process of the eigenvalues of real or complex non-Hermitian matrices $X$ with independent, identically distributed entries is hyperuniform: the variance of the number of eigenvalues in a subdomain $\Omega$ of the…
We compute the exact value of the squared condition number for the polynomial eigenvalue problem, when the input matrices have entries coming from the standard complex Gaussian distribution, showing that in general this problem is quite…
Let M be an arbitrary Hermitian matrix of order n, and k be a positive integer less than or equal to n. We show that if k is large, the distribution of eigenvalues on the real line is almost the same for almost all principal submatrices of…
For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…