pith. sign in

arxiv: 1404.0071 · v1 · pith:NLVLH6IHnew · submitted 2014-04-01 · 🧮 math-ph · math.MP· math.PR

Sampling unitary invariant ensembles

classification 🧮 math-ph math.MPmath.PR
keywords algorithmensemblesinvariantsamplingunitaryanalysisbeyondcalculable
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.