Grant: Discovery Grants Program - Individual
Queen's University
$18,000.00
Free Probability and Random Matrices
EF 2020-21
Résumé
A fundamental problem in many branches of science and engineering is to describe and analyse the distributions of a correlated set of random points, often called a point process. The simplest example of this problem is to independently sample from the same probability distribution. The statistics of this example can be analysed by the laws of classical probability going back to De Moivre. However in many examples the points are correlated in subtle and complicated way and we still want to be able to describe these correlations.
An important example is in the study of correlation matrices. In these matrices the (i,j) entry is given by the correlation between the i-th and j-th variables. By examining the singular numbers of the matrix one can distinguish signal from noise or the absence of correlations between the variables.
In wireless communication theory we have to analyse networks where there are multiple transmitting and receiving antennas. A goal here is to estimate the capacity of the channel and again it is the singular value or eigenvalue distribution that is used.
In quantum information theory it is important to detect entangled states. To solve this problem some mathematical methods have been found called entanglement detectors that announce that a matrix is entangled. One such detector is the partial transpose, for if the partial transpose of a positive matrix fails to be positive then the matrix was entangled. As positivity is an eigenvalue question we are again led to eigenvalue distributions.
Thus the general problem in random matrix theory is to find the eigenvalue distribution of the matrix. Since the entries of the matrix are random the eigenvalues are random. So each instance of the matrix gives n eigenvalues and we get a random set of n points. We shall consider self-adjoint matrices in which case the eigenvalues are all real and so we get a random probability measure on the real line. With random measure we have random moments and these random moments have correlations, skewness, kurtosis, and all higher cumulants.
Typically these higher cumulants are very complicated and thought to be too difficult to analyse. However it was noticed that as the number of points increases the complexity melts away and magically simple and beautiful combinatorial pictures emerge. These are the non-crossing partitions or planar graphs.
The goal of this proposal is to extend my previous work on analysing the asymptotics of these higher cumulants, both combinatorially and in the context of analytic functions. The training component of the proposed research will provide students with an understanding of free probability and random matrices theory which will enable them to pursue careers in academia as well as mathematical finance, wireless communication, and quantum computation.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2018-04458
Name nom
MINGO, James
Department département
Mathematics and Statistics
Organization id
29
Institution établissement
Queen's University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2020
Competition year année de concours
2018
Award amount
18000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2904
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Operator algebra
Research subject fr
Algèbre des opérateurs
Installment
inst:3-5
Partie
3
Nb partie
5
Application title
Free Probability and Random Matrices
Keyword
NSERC
Application summary
A fundamental problem in many branches of science and engineering is to describe and analyse the distributions of a correlated set of random points, often called a point process. The simplest example of this problem is to independently sample from the same probability distribution. The statistics of this example can be analysed by the laws of classical probability going back to De Moivre. However in many examples the points are correlated in subtle and complicated way and we still want to be able to describe these correlations.
An important example is in the study of correlation matrices. In these matrices the (i,j) entry is given by the correlation between the i-th and j-th variables. By examining the singular numbers of the matrix one can distinguish signal from noise or the absence of correlations between the variables.
In wireless communication theory we have to analyse networks where there are multiple transmitting and receiving antennas. A goal here is to estimate the capacity of the channel and again it is the singular value or eigenvalue distribution that is used.
In quantum information theory it is important to detect entangled states. To solve this problem some mathematical methods have been found called entanglement detectors that announce that a matrix is entangled. One such detector is the partial transpose, for if the partial transpose of a positive matrix fails to be positive then the matrix was entangled. As positivity is an eigenvalue question we are again led to eigenvalue distributions.
Thus the general problem in random matrix theory is to find the eigenvalue distribution of the matrix. Since the entries of the matrix are random the eigenvalues are random. So each instance of the matrix gives n eigenvalues and we get a random set of n points. We shall consider self-adjoint matrices in which case the eigenvalues are all real and so we get a random probability measure on the real line. With random measure we have random moments and these random moments have correlations, skewness, kurtosis, and all higher cumulants.
Typically these higher cumulants are very complicated and thought to be too difficult to analyse. However it was noticed that as the number of points increases the complexity melts away and magically simple and beautiful combinatorial pictures emerge. These are the non-crossing partitions or planar graphs.
The goal of this proposal is to extend my previous work on analysing the asymptotics of these higher cumulants, both combinatorially and in the context of analytic functions. The training component of the proposed research will provide students with an understanding of free probability and random matrices theory which will enable them to pursue careers in academia as well as mathematical finance, wireless communication, and quantum computation.