Sampling unitary invariant ensembles
  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. 
Sheehan Olver, Raj Rao Nadakuditi, Thomas Trogdon
math-ph math.MP math.PR