Related papers: Exact Statistical Characterization of $2\times2$ G…
Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…
In classical random matrix theory the Gaussian and chiral Gaussian random matrix models with a source are realized as shifted mean Gaussian, and chiral Gaussian, random matrices with real $(\beta = 1)$, complex ($\beta = 2)$ and real…
We derive exact results for gap probabilities, as well as densities of extreme eigenvalues for six complex random matrix ensembles of fundamental importance. These are Gauss-Wigner, Laguerre-Wishart, Cauchy-Lorentz (two variants),…
We continue the study of random matrix universality in two-dimensional conformal field theories. This is facilitated by expanding the spectral form factor in a basis of modular invariant eigenfunctions of the Laplacian on the fundamental…
We consider an ensemble of large non-Hermitian random matrices of the form $\hat{H}+i\hat{A}_s$, where $\hat{H}$ and $\hat{A}_s$ are Hermitian statistically independent random $N\times N$ matrices. We demonstrate the existence of a new…
We initiate the study of goodness-of-fit testing when the data consist of positive definite matrices. Motivated by the recent appearance of the cone of positive definite matrices in numerous areas of applied research, including diffusion…
The outage probability of maximal-ratio combining (MRC) for a multiple-input multiple-output (MIMO) wireless communications system under Rician fading is given by the cumulative distribution function (CDF) for the largest eigenvalue of a…
Consider a doubly-infinite array of iid centered variables with moment conditions, from which one can extract a finite number of rectangular, overlapping submatrices, and form the corresponding Wishart matrices. We show that under basic…
I present a simple dynamic programming algorithm for the evaluation of operators in a wide range of superconformal algebras. Special care is taken to describe the computation of the Gram matrix. A Mathematica package, Weaver.m, is provided…
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…
We develop simple methods for constructing parameter priors for model choice among Directed Acyclic Graphical (DAG) models. In particular, we introduce several assumptions that permit the construction of parameter priors for a large number…
In this paper, we study the limiting distribution of the eigenvalues for random tridiagonal matrix models. The limiting distribution is well described by its moments. Here, an analytical approach allows us, as in the case of Wigner…
In this work, we study a class of random matrices which interpolate between the Wigner matrix model and various types of patterned random matrices such as random Toeplitz, Hankel, and circulant matrices. The interpolation mechanism is…
For a matrix ${\bf A}$ with linearly independent columns, this work studies to use its normalization $\bar{\bf A}$ and ${\bf A}$ itself to approximate its orthonormalization $\bf V$. We theoretically analyze the order of the approximation…
In this paper we consider Wigner random matrices -- symmetric n by n random matrices whose entries are independent identically distributed real random variables. We prove that the probability distribution of one or several eigenvalues close…
We review our recent results on pseudo-hermitian random matrix theory which were hitherto presented in various conferences and talks. (Detailed accounts of our work will appear soon in separate publications.) Following an introduction of…
Recently, D. Wang has devised a new contour integral based method to simplify certain matrix integrals. Capitalizing on that approach, we derive a new expression for the probability density function (p.d.f.) of the joint eigenvalues of a…
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…
Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…
We propose a second-order accurate method to estimate the eigenvectors of extremely large matrices thereby addressing a problem of relevance to statisticians working in the analysis of very large datasets. More specifically, we show that…