Random Matrix Theory

The beautiful world of Wigner

29 Aug 2021

My first encounter with Wigner’s name was when I was suggested to read the Wigner-Ville distribution and Gabor transform during my brief work on a signal processing project three years back. The project was short and I did not care to make any in-depth venture into Wigner’s work. A couple years after that I had started to read on random matrix perturbations when I started come across terms such as Wigner matrix, Wigner’s surmise, Wigner semi-circle law, and so on. Now this piqued my interest because I had heard of Wigner before. Upon looking up the Wikipedia page I found that Eugene Wigner was a physicist (well, primarily) and a Nobel laureate (1963)!
Only recently I had the pleasure of coming across the The Oxford Handbook of Random Matrix Theory (OH-RMT), and I am so very thankful to myself for digging on this subject in our library catalogue. This blog (hopefully a series) will be based on this book and few external supportive research/reading that I conduct. So, as I read along, start to understand the origins and implications of Random Matrix Theory (RMT) (and get my mind blown), I will continue writing on this. This is such an ocean of knowledge, I will be extremely happy if I can digest even a drop of it.

It is indeed very hard (as a novice) to decide from where to begin. Let me start by defining some matrices and matrix ensembles. Let us say \(\mathbf{W}\) is an \(n\)-dimensional symmetric matrix with the \((i,j)\)-th entry denoted by \(W_{ij}\). \(\mathbf{W}\) is a Wigner matrix if it satisfies the following conditions:

Next, let us learn about some matrix ensembles, more specifically Gaussian ensembles. The name Gaussian ensemble suggest that it has something to do with the Gaussian or Normal distribution. We will see that in a bit, but why “ensembles”? Well, to study asymptotics (or convergence) we most obviously need the number of “virtual” copies to be large or in this case we need the dimension of matrix to be large. The entries of a Gaussian ensemble, \(\mathbf{H}_{n}\) (the subscript \(n\) denotes the dimension of the matrix as well as hinting at the fact that a growing \(n\) is used to study asymptotics), are independent upto symmetry and have the following probability density:

\[\begin{align*} f(\mathbf{H}) = \frac{1}{Z_{GE}}\exp\left(-\frac{n\beta}{4}\operatorname{tr}(\mathbf{H}^{2})\right) \end{align*}\]

\(Z_{GE}\) is the normalizing constant which depends on the type of ensemble. Three types of ensembles are typically considered: Gaussian Orthogonal Ensemble (GOE), Gaussian Unitary Ensemble (GUE) and Gaussian Simplectic Ensemble (GSE). So the density is essentially proportional to an exponent. Now the exponent depends on the term \(\beta\), called the Dyson index which takes values \(1\) for GOE, \(2\) for GUE and \(4\) for GSE. (OH-RMT has its foreword written by Freeman Dyson!)

The Dyson index basically counts the number of real elements associated with each entry of the matrix. continued here