• Corpus ID: 51767183

Sampling unitary invariant ensembles

@article{Olver2014SamplingUI,
  title={Sampling unitary invariant ensembles},
  author={Sheehan Olver and Raj Rao Nadakuditi and Thomas Trogdon},
  journal={arXiv: Mathematical Physics},
  year={2014}
}
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 polynomials. Using this algorithm, statistics beyond those known through analysis are calculable through Monte Carlo simulation. Unexpected phenomena are observed in the simulations. 
View PDF on arXiv
5 Citations
Highly Influential Citations
2
Background Citations
2
Methods Citations
3
Results Citations
2

Figures from this paper

5 Citations

Fast sampling from ˇ -ensembles

The experimental results support a conjecture by Krishnapur et al. (Commun Pure Appl Math 69(1): 145–199, 2016), that the Gibbs chain on Jacobi matrices of size N mixes in O ( log N ) .

Some Open Problems in Random Matrix Theory and the Theory of Integrable Systems. II

We describe a list of open problems in random matrix theory and integrable systems which was presented at the conference ``Integrable Systems, Random Matrices, and Applications'' at the Courant…

Fast sampling from $$\beta $$ β -ensembles

The experimental results support a conjecture by Krishnapur et al. (Commun Pure Appl Math 69(1): 145–199, 2016), that the Gibbs chain on Jacobi matrices of size N mixes in $\mathcal {O}(\log N)$$ O ( log N ) .

Universality in numerical computations with random data

Evidence for universality in numerical computations with random data, which includes six standard numerical algorithms as well as a model of neural computation and decision-making, is presented.

N A ] 1 6 Ju l 2 01 4 Universality in Numerical Computations with Random Data . Case Studies

The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations)…

References

SHOWING 1-10 OF 35 REFERENCES

Random matrices: Universality of local eigenvalue statistics

In this paper, we consider the universality of the local eigenvalue statistics of random matrices. Our main result shows that these statistics are determined by the first four moments of the…

The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators

The technique is used in an empirical study of two methods for estimating the condition number of a matrix in the group of orthogonal matrices.

Fast inverse transform sampling in one and two dimensions

We develop a computationally efficient and robust algorithm for generating pseudo-random samples from a broad class of smooth probability distributions in one and two dimensions. The algorithm is…

Computation of equilibrium measures

  • S. Olver
  • Mathematics
    J. Approx. Theory
  • 2011

Random Matrix Theory: Invariant Ensembles and Universality

This book features a unified derivation of the mathematical theory of the three classical types of invariant random matrix ensembles - orthogonal, unitary, and symplectic. The authors follow the…

Numerical Solution of Riemann–Hilbert Problems: Random Matrix Theory and Orthogonal Polynomials

Recently, a general approach to solving Riemann–Hilbert problems numerically has been developed. We review this numerical framework and apply it to the calculation of orthogonal polynomials on the…

Matrix models for beta ensembles

This paper constructs tridiagonal random matrix models for general (β>0) β-Hermite (Gaussian) and β-Laguerre (Wishart) ensembles. These generalize the well-known Gaussian and Wishart models for…

Numerical study of higher order analogues of the Tracy-Widom distribution

We study a family of distributions that arise in critical unitary random matrix ensembles. They are expressed as Fredholm determinants and describe the limiting distribution of the largest eigenvalue…

The Polynomial Method for Random Matrices

The mathematics of the polynomial method is developed which allows us to describe the class of algebraic matrices by its generators and map the constructive approach when proving algebraicity into a software implementation that is available for download in the form of the RMTool random matrix “calculator” package.

Determinantal Processes and Independence

We give a probabilistic introduction to determinantal and per- manental point processes. Determinantal processes arise in physics (fermions, eigenvalues of random matrices) and in combinatorics…