Related papers: On the rightmost eigenvalue of non-Hermitian rando…

Let $x$ be a complex random variable such that ${\E {x}=0}$, ${\E |x|^2=1}$, ${\E |x|^{4} < \infty}$. Let $x_{ij}$, $i,j \in \{1,2,...\}$ be independet copies of $x$. Let ${\Xb=(N^{-1/2}x_{ij})}$, $1\leq i,j \leq N$ be a random matrix.…

For a general class of large non-Hermitian random block matrices $\mathbf{X}$ we prove that there are no eigenvalues away from a deterministic set with very high probability. This set is obtained from the Dyson equation of the Hermitization…

We derive a multiplication law for free non-hermitian random matrices allowing for an easy reconstruction of the two-dimensional eigenvalue distribution of the product ensemble from the characteristics of the individual ensembles. We define…

Two-term asymptotic formulae for the probability distribution functions for the smallest eigenvalue of the Jacobi $ \beta $-Ensembles are derived for matrices of large size in the r\'egime where $ \beta > 0 $ is arbitrary and one of the…

We consider the limiting location and limiting distribution of the largest eigenvalue in real symmetric ($\beta$ = 1), Hermitian ($\beta$ = 2), and Hermitian self-dual ($\beta$ = 4) random matrix models with rank 1 external source. They are…

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…

We prove quadratic eigenvalue perturbation bounds for generalized Hermitian eigenvalue problems. The bounds are proportional to the square of the norm of the perturbation matrices divided by the gap between the spectrums. Using the results…

We consider the standard overlap $\mathcal{O}_{ij}: =\langle \mathbf{r}_j, \mathbf{r}_i\rangle\langle \mathbf{l}_j, \mathbf{l}_i\rangle$ of any bi-orthogonal family of left and right eigenvectors of a large random matrix $X$ with centred…

Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for $p(n)$ and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion…

Let $ \bbB_n =\frac{1}{n}(\bbR_n + \bbT^{1/2}_n \bbX_n)(\bbR_n + \bbT^{1/2}_n \bbX_n)^* $ where $ \bbX_n $ is a $ p \times n $ matrix with independent standardized random variables, $ \bbR_n $ is a $ p \times n $ non-random matrix,…

We show that finite rank perturbations of certain random matrices fit in the framework of infinitesimal (type B) asymptotic freeness. This can be used to explain the appearance of free harmonic analysis (such as subordination functions…

Let $X$ be a $p\times n$ independent identically distributed real Gaussian matrix with positive mean $\mu $ and variance $\sigma^2$ entries. The goal of this paper is to investigate the largest eigenvalue of the noncentral sample covariance…

Consider the matrix products $G_n: = g_n \ldots g_1$, where $(g_{n})_{n\geq 1}$ is a sequence of independent and identically distributed positive random $d\times d$ matrices. Under the optimal third moment condition, we first establish a…

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…

The problem of binary hypothesis testing between two probability measures is considered. New sharp bounds are derived for the best achievable error probability of such tests based on independent and identically distributed observations.…

The Brent-McMillan algorithm is the fastest known procedure for the high-precision computation of Euler's constant $\gamma$ and is based on the modified Bessel functions $I_0(2x)$ and $K_0(2x)$. An error estimate for this algorithm relies…

We obtain uniform asymptotics for polynomials orthogonal on a fixed and varying arc of the unit circle with a positive analytic weight function. We also complete the proof of the large $s$ asymptotic expansion for the Fredholm determinant…

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…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…

Let X_i, i\in N, be i.i.d. B-valued random variables, where B is a real separable Banach space. Let \Phi be a smooth enough mapping from B into R. An asymptotic evaluation of Z_n=E(\exp (n\Phi (\sum_{i=1}^nX_i/n))), up to a factor (1+o(1)),…