Related papers: Eigenvalue Statistics for Generalized Symmetric an…
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…
We consider random matrix ensembles on the set of Hermitian matrices that are heavy tailed, in particular not all moments exist, and that are invariant under the conjugate action of the unitary group. The latter property entails that the…
It is known that hermitean random matrix ensembles can be identified with symmetric coset spaces of Lie groups, or else with tangent spaces of the same. This results in a classification of random matrix ensembles as well as applications in…
We introduce a generalized ensemble of nonhermitian matrices interpolating between the Gaussian Unitary Ensemble, the Ginibre ensemble and the Poisson ensemble. The joint eigenvalue distribution of this model is obtained by means of an…
We develop a supersymmetric field theoretical description of the Gaussian ensemble of the almost diagonal Hermitian Random Matrices. The matrices have independent random entries H_{ij} with parametrically small off-diagonal elements…
Nearest neighbor is a popular nonparametric method for classification and regression with many appealing properties. In the big data era, the sheer volume and spatial/temporal disparity of big data may prohibit centrally processing and…
We develop sampling algorithms to fit Bayesian hierarchical models, the computational complexity of which scales linearly with the number of observations and the number of parameters in the model. We focus on crossed random effect and…
Generalized singular values (GSVs) play an essential role in the comparative analysis. In the real world data for comparative analysis, both data matrices are usually numerically low-rank. This paper proposes a randomized algorithm to first…
We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…
We describe a subtle error which can appear in numerical calculations involving the spacing statistics of eigenvalues of random unitary matrices.
We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…
Metropolis Hastings nested sampling evolves a Markov chain, accepting new points along the chain according to a version of the Metropolis Hastings acceptance ratio, which has been modified to satisfy the nested sampling likelihood…
We consider $N\times N$ random matrices of the form $H = W + V$ where $W$ is a real symmetric Wigner matrix and $V$ a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume subexponential decay for…
We calculate eigenvector statistics in an ensemble of non-Hermitian matrices describing open quantum systems [F. Haake et al., Z. Phys. B 88, 359 (1992)] in the limit of large matrix size. We show that ensemble-averaged eigenvector…
Eigenvalue distributions are important dynamical quantities in matrix models, and it is an interesting challenge to study corresponding quantities in tensor models. We study real tensor eigenvalue/vector distributions for real symmetric…
The addition of noise has a regularizing effect on Hermitian matrices. This effect is studied here for $H=A+V$, where $A$ is the base matrix and $V$ is sampled from the GOE or the GUE random matrix ensembles. We bound the mean number of…
We consider random Hermitian matrices made of complex or real $M\times N$ rectangular blocks, where the blocks are drawn from various ensembles. These matrices have $N$ pairs of opposite real nonvanishing eigenvalues, as well as $M-N$ zero…
Generative Adversarial Networks have shown remarkable success in learning a distribution that faithfully recovers a reference distribution in its entirety. However, in some cases, we may want to only learn some aspects (e.g., cluster or…
Stochastic Neighbor Embedding (SNE) is a manifold learning and dimensionality reduction method with a probabilistic approach. In SNE, every point is consider to be the neighbor of all other points with some probability and this probability…
We study the reduced energy spectrum $\{E_{i}^{(n)}\}$, which is constructed by picking one level from every $n$ levels of the original spectrum $\{E_{i}\}$, in a Gaussian ensemble of random matrix with Dyson index $\beta\in \left( 0,\infty…