Circular ensemble

From Wikipedia, the free encyclopedia
  (Redirected from Circular ensembles)
Jump to: navigation, search

In the theory of random matrices, the circular ensembles are measures on spaces of unitary matrices introduced by Freeman Dyson as modifications of the Gaussian matrix ensembles.[1] The three main examples are the circular orthogonal ensemble (COE) on symmetric unitary matrices, the circular unitary ensemble (CUE) on unitary matrices, and the circular symplectic ensemble (CSE) on self dual unitary quaternionic matrices.

Probability distributions[edit]

The distribution of the unitary circular ensemble CUE(n) is the Haar measure on the unitary group U(n). If U is a random element of CUE(n), then UTU is a random element of COE(n); if U is a random element of CUE(2n), then URU is a random element of CSE(n), where

 U^R = \left( \begin{array}{ccccccc} 0 & -1 & & & & &  \\ 1 & 0 &  & & & & \\ & & 0 & -1 &  & &  \\ & & 1 & 0  & & & \\ & & & & \ddots & & \\ & & & & & 0& -1\\ & & & & & 1 & 0 \end{array} \right) U^T \left( \begin{array}{ccccccc} 0 & 1 & & & & &  \\ -1 & 0 &  & & & & \\ & & 0 & 1 &  & &  \\ & & -1 & 0  & & & \\ & & & & \ddots & & \\ & & & & & 0& 1\\ & & & & & -1 & 0 \end{array} \right)~.

Each element of a circular ensemble is a unitary matrix, so it has eigenvalues on the unit circle: e^{i\theta_k} with 0 < θk < 2π and k=1,2,... n. (In the CSE each of these n eigenvalues appears twice.) The probability density function of the phases θk is given by

 p(\theta_1, \cdots, \theta_n) = \frac{1}{Z_{n,\beta}} \prod_{1 \leq k < j \leq n} |e^{i \theta_k} - e^{i \theta_j}|^\beta~,

where β=1 for COE, β=2 for CUE, and β=4 for CSE. The normalisation constant Zn,β is given by

 Z_{n,\beta} = (2\pi)^n \frac{\Gamma(\beta n/2 + 1)}{\left(\Gamma(\beta/2 + 1)\right)^n}~.

Generalizations[edit]

Generalizations of the circular ensemble restrict the matrix elements of U to real numbers [so that U is in the orthogonal group O(n)] or to real quaternion numbers [so that U is in the symplectic group Sp(2n). The Haar measure on the orthogonal group produces the circular real ensemble (CRE) and the Haar measure on the symplectic group produces the circular quaternion ensemble (CQE).

The eigenvalues of orthogonal matrices come in complex conjugate pairs e^{i\theta_k} and e^{-i\theta_k}, possibly complemented by eigenvalues fixed at +1 or -1. For n=2m even and det U=1, there are no fixed eigenvalues and the phases θk have probability distribution [2]

 p(\theta_1, \cdots, \theta_m) = C \prod_{1 \leq k < j \leq m} (\cos\theta_k - \cos\theta_j)^2~,

with C an unspecified normalization constant. For n=2m+1 odd there is one fixed eigenvalue σ=det U equal to ±1. The phases have distribution

 p(\theta_1, \cdots, \theta_m) = C \prod_{1 \leq i \leq m}(1-\sigma\cos\theta_i)  \prod_{1 \leq k < j \leq m} (\cos\theta_k - \cos\theta_j)^2~.

For n=2m+2 even and det U=-1 there is a pair of eigenvalues fixed at +1 and -1, while the phases have distribution

 p(\theta_1, \cdots, \theta_m) = C \prod_{1 \leq i \leq m}(1-\cos^2\theta_i)  \prod_{1 \leq k < j \leq m} (\cos\theta_k - \cos\theta_j)^2~.

This is also the distribution of the eigenvalues of a matrix in Sp(2m).

These probability density functions are referred to as Jacobi distributions in the theory of random matrices, because correlation functions can be expressed in terms of Jacobi polynomials.

Calculations[edit]

Averages of products of matrix elements in the circular ensembles can be calculated using Weingarten functions. For large dimension of the matrix these calculations become impractical, and a numerical method is advantageous. There exist efficient algorithms to generate random matrices in the circular ensembles.[3]

References[edit]

  1. ^ F.M. Dyson (1962). "The threefold way. Algebraic structure of symmetry groups and ensembles in quantum mechanics". J. Math. Phys. 3: 1199. doi:10.1063/1.1703863. 
  2. ^ V.L. Girko (1985). "Distribution of eigenvalues and eigenvectors of orthogonal random matrices". Ukr. Math. J. 37: 457. doi:10.1007/bf01061167. 
  3. ^ F. Mezzadri (2007). "How to generate random matrices from the classical compact groups". Notices of the AMS 54: 592. arXiv:math-ph/0609050. 

External links[edit]

  • Mehta, Madan Lal (2004), Random matrices, Pure and Applied Mathematics (Amsterdam) 142 (3rd ed.), Elsevier/Academic Press, Amsterdam, ISBN 978-0-12-088409-4, MR 2129906 
  • Forrester, Peter J. (2010), Log-gases and random matrices, Princeton University Press, ISBN 978-0-691-12829-0