Related papers: How to generate random matrices from the classical…
Composed ensembles of random unitary matrices are defined via products of matrices, each pertaining to a given canonical circular ensemble of Dyson. We investigate statistical properties of spectra of some composed ensembles and demonstrate…
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of…
We consider random non-normal matrices constructed by removing one row and column from samples from Dyson's circular ensembles or samples from the classical compact groups. We develop sparse matrix models whose spectral measures match these…
We consider random stochastic matrices $M$ with elements given by $M_{ij}=|U_{ij}|^2$, with $U$ being uniformly distributed on one of the classical compact Lie groups or associated symmetric spaces. We observe numerically that, for large…
We give a generalization of the random matrix ensembles, including all lassical ensembles. Then we derive the joint density function of the generalized ensemble by one simple formula, which give a direct and unified way to compute the…
This paper considers random matrices distributed according to Haar measure in different classical compact groups. Utilizing the determinantal point structures of their nontrivial eigenangles, with respect to the $L_1$-Wasserstein distance,…
This paper presents an algorithmic method for generating random orthogonal matrices \(A\) that satisfy the property \(A^t S A = S\), where \(S\) is a fixed real invertible symmetric or skew-symmetric matrix. This method is significant as it…
We develop an algorithm for sampling from the unitary invariant random matrix ensembles. The algorithm is based on the representation of their eigenvalues as a determinantal point process whose kernel is given in terms of orthogonal…
Recent theoretical studies of chaotic scattering have encounted ensembles of random matrices in which the eigenvalue probability density function contains a one-body factor with an exponent proportional to the number of eigenvalues. Two…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…
We consider powers of the absolute value of the characteristic polynomial of Haar distributed random orthogonal or symplectic matrices, as well as powers of the exponential of its argument, as a random measure on the unit circle minus small…
We complete Dyson's dream by cementing the links between symmetric spaces and classical random matrix ensembles. Previous work has focused on a one-to-one correspondence between symmetric spaces and many but not all of the classical random…
This is a survey article written for a workshop on L-functions and random matrix theory at the Newton Institute in July, 2004. The goal is to give some insight into how well-distributed sets of matrices in classical groups arise from…
The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
In this work, we present a method to generate probability distributions and classes of probability distributions, which broadens a process of probability distribution construction. In this method, distribution classes are built from…
The class of norm-dependent Random Matrix Ensembles is studied in the presence of an external field. The probability density in those ensembles depends on the trace of the squared random matrices, but is otherwise arbitrary. An exact…
We study random vectors of the form $(\operatorname {Tr}(A^{(1)}V),...,\operatorname {Tr}(A^{(r)}V))$, where $V$ is a uniformly distributed element of a matrix version of a classical compact symmetric space, and the $A^{(\nu)}$ are…
We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…
A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…