Related papers: Theory of random matrices with strong level confin…

For the orthogonal-unitary and symplectic-unitary transitions in random matrix theory, the general parameter dependent distribution between two sets of eigenvalues with two different parameter values can be expressed as a quaternion…

In deriving large n probability distribution function of the rightmost eigenvalue from the classical Random Matrix Theory Ensembles, one is faced with que question of finding large n asymptotic of certain coupled set of functions. This…

We compute analytically the probability density function (pdf) of the largest eigenvalue $\lambda_{\max}$ in rotationally invariant Cauchy ensembles of $N\times N$ matrices. We consider unitary ($\beta = 2$), orthogonal ($\beta =1$) and…

The diagonalization of Hermitian supermatrices is studied. Such a change of coordinates is inevitable to find certain structures in random matrix theory. However it still poses serious problems since up to now the calculation of all…

In this paper we focus on the large n probability distribution function of the largest eigenvalue in the Gaussian Orthogonal Ensemble of n by n matrices (GOEn). We prove an Edgeworth type Theorem for the largest eigenvalue probability…

Extremal spacings between eigenvalues of random unitary matrices of size N pertaining to circular ensembles are investigated. Explicit probability distributions for the minimal spacing for various ensembles are derived for N = 4. We study…

We give simple criteria to identify the exponential order of magnitude of the absolute value of the determinant for wide classes of random matrix models, not requiring the assumption of invariance. These include Gaussian matrices with…

The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…

We place ourselves in the setting of high-dimensional statistical inference, where the number of variables $p$ in a data set of interest is of the same order of magnitude as the number of observations $n$. More formally, we study the…

In this paper we study the distribution of the scaled largest eigenvalue of complexWishart matrices, which has diverse applications both in statistics and wireless communications. Exact expressions, valid for any matrix dimensions, have…

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

We study the eigenvalues and the eigenvectors of $N\times N$ structured random matrices of the form $H = W\tilde{H}W+D$ with diagonal matrices $D$ and $W$ and $\tilde{H}$ from the Gaussian Unitary Ensemble. Using the supersymmetry technique…

We prove empirical central limit theorems for the distribution of levels of various random fields defined on high-dimensional discrete structures as the dimension of the structure goes to $\infty$. The random fields considered include costs…

We show that the average characteristic polynomial P_n(z) = E [\det(zI-M)] of the random Hermitian matrix ensemble Z_n^{-1} \exp(-Tr(V(M)-AM))dM is characterized by multiple orthogonality conditions that depend on the eigenvalues of the…

Skew orthogonal polynomials arise in the calculation of the $n$-point distribution function for the eigenvalues of ensembles of random matrices with orthogonal or symplectic symmetry. In particular, the distribution functions are completely…

We construct a very general family of characteristic functions describing Random Matrix Ensembles (RME) having a global unitary invariance, and containing an arbitrary, one-variable probability measure which we characterize by a `spread…

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

We continue studying polynomials generated by the Szeg\H{o} recursion when a finite number of Verblunsky coefficients lie outside the closed unit disk. We prove some asymptotic results for the corresponding orthogonal polynomials and then…

McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…

We study the asymptotic limit for large matrix dimension N of the partition function of the unitary ensemble with weight exp(-z^2/2x^2 + t/x - x^2/2). We compute the leading order term of the partition function and of the coefficients of…