Related papers: Pfaffian point process for the Gaussian real gener…
Pencils of Hankel matrices whose elements have a joint Gaussian distribution with nonzero mean and not identical covariance are considered. An approximation to the distribution of the squared modulus of their determinant is computed which…
We consider real, Gauss-divisible matrices $A_{t}=A+\sqrt{t}B$, where $B$ is from the real Ginibre ensemble. We prove that the bulk correlation functions converge to a universal limit for $t=O(N^{-1/3+\epsilon})$ if $A$ satisfies certain…
We compute analytically, for large N, the probability distribution of the number of positive eigenvalues (the index N_{+}) of a random NxN matrix belonging to Gaussian orthogonal (\beta=1), unitary (\beta=2) or symplectic (\beta=4)…
We study the generalized eigenvalue problem in $\mathbb{R}^N$ for a general convex nonlinear elliptic operator which is locally elliptic and positively $1$-homogeneous. Generalizing article of Berestycki and Rossi in [Comm. Pure Appl. Math.…
We construct the general solution of the equation $w_t+\sum\limits_{k=1}^nw_{x_k}\rho^{(k)}(w)=\rho(w)+[w,T\tilde\rho(w)]$, for the $N\times N$ matrix $w$, where $T$ is any constant diagonal matrix, $n, N \in \NN_+$ and $\rho^{(k)}, \rho,…
We introduce a general method for transforming the equations of motion following from a Das-Jevicki-Sakita Hamiltonian, with boundary conditions, into a boundary value problem in one-dimensional quantum mechanics. For the particular case of…
A recursive method is derived to calculate all eigenvalue correlation functions of a random hermitian matrix in the large size limit, and after smoothing of the short scale oscillations. The property that the two-point function is…
It is well known that Pfaffian formulas for eigenvalue correlations are useful in the analysis of real and quaternion random matrices. Moreover the parametric correlations in the crossover to complex random matrices are evaluated in the…
By conformal welding, there is a pair of univalent functions $(f,g)$ associated to every point of the complex K\"ahler manifold $\Mob(S^1)\bk\Diff_+(S^1)$. For every integer $n\geq 1$, we generalize the definition of Faber polynomials to…
We derive the mean eigenvalue density for symmetric Gaussian random N x N matrices in the limit of large N, with a constraint implying that the row sum of matrix elements should vanish. The result is shown to be equivalent to a result found…
We discuss an approach to compute the first and second moments of the number of eigenvalues $I_N$ that lie in an arbitrary interval of the real line for $N \times N$ Gaussian random matrices. The method combines the standard…
In the past 20 years, the study of real eigenvalues of non-symmetric real random matrices has seen important progress. Notwithstanding, central questions still remain open, such as the characterization of their asymptotic statistics and the…
For a given normalized Gaussian symmetric matrix-valued process $Y^{(n)}$, we consider the process of its eigenvalues $\{(\lambda_{1}^{(n)}(t),\dots, \lambda_{n}^{(n)}(t)); t\ge 0\}$ as well as its corresponding process of empirical…
We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the…
In this letter we present an analytic method for calculating the transition probability between two random Gaussian matrices with given eigenvalue spectra in the context of Dyson Brownian motion. We show that in the Coulomb gas language, in…
We consider the product of n complex non-Hermitian, independent random matrices, each of size NxN with independent identically distributed Gaussian entries (Ginibre matrices). The joint probability distribution of the complex eigenvalues of…
For an $n \times n$ independent-entry random matrix $X_n$ with eigenvalues $\lambda_1, \ldots, \lambda_n$, the seminal work of Rider and Silverstein asserts that the fluctuations of the linear eigenvalue statistics $\sum_{i=1}^n…
We describe two algorithms for the eigenvalue, eigenvector problem which, on input a Gaussian matrix with complex entries, finish with probability 1 and in average polynomial time.
The Gaussian polytope $\mathcal P_{n,d}$ is the convex hull of $n$ independent standard normally distributed points in $\mathbb R^d$. We derive explicit expressions for the probability that $\mathcal P_{n,d}$ contains a fixed point…
The eigenvalue density for members of the Gaussian orthogonal and unitary ensembles follows the Wigner semi-circle law. If the Gaussian entries are all shifted by a constant amount c/Sqrt(2N), where N is the size of the matrix, in the large…