随机矩阵算子极限的简要介绍

Pub Date : 2019-10-30 DOI:10.1090/pcms/026/05
D. Holcomb, B. Virág
{"title":"随机矩阵算子极限的简要介绍","authors":"D. Holcomb, B. Virág","doi":"10.1090/pcms/026/05","DOIUrl":null,"url":null,"abstract":"These are notes to a four-lecture minicourse given at the 2017 PCMI Summer Session on Random Matrices. We give a quick introduction to the theory of large random matrices by taking limits that preserve their operator structure, rather than just their eigenvalues. The operator structure takes the role of exact formulas, and allows for results in the context of general β-ensembles. Along the way, we cover a non-computational proof of the Wiegner semicircle law, a quick proofs for the Füredi-Komlós result on the top eigenvalue, as well as the BBP phase transition. 1. The Gaussian Ensembles 1.1. The Gaussian Orthogonal and Unitary Ensembles. One of the earliest appearances of random matrices in mathematics was due to Eugene Wigner in the 1950’s. Let G be an n×nmatrix with independent standard normal entries. Then Mn = G+Gt √ 2 . This distribution on symmetric matrices is called the Gaussian Orthogonal Ensemble, because it is invariant under orthogonal conjugation. For any orthogonal matrix OMnO has the same distribution as Mn. To check this, note that OG has the same distribution as G be the rotation invariance of the Gaussian column vectors, and the same is true for OGO−1 by the rotation invariance of the row vectors. To finish note that orthogonal conjugation commutes with symmetrization. If we instead start with a matrix with independent standard complex Gaussian entries, we get the Gaussian Unitary ensemble. To see how the eigenvalues behave, we recall the following classical theorem. Theorem 1.1.1. Suppose Mn has GOE or GUE distribution then Mn has eigenvalue density (1.1.2) f(λ1, ..., λn) = 1 Zn n ∏","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A short introduction to operator limits of\\n random matrices\",\"authors\":\"D. Holcomb, B. Virág\",\"doi\":\"10.1090/pcms/026/05\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"These are notes to a four-lecture minicourse given at the 2017 PCMI Summer Session on Random Matrices. We give a quick introduction to the theory of large random matrices by taking limits that preserve their operator structure, rather than just their eigenvalues. The operator structure takes the role of exact formulas, and allows for results in the context of general β-ensembles. Along the way, we cover a non-computational proof of the Wiegner semicircle law, a quick proofs for the Füredi-Komlós result on the top eigenvalue, as well as the BBP phase transition. 1. The Gaussian Ensembles 1.1. The Gaussian Orthogonal and Unitary Ensembles. One of the earliest appearances of random matrices in mathematics was due to Eugene Wigner in the 1950’s. Let G be an n×nmatrix with independent standard normal entries. Then Mn = G+Gt √ 2 . This distribution on symmetric matrices is called the Gaussian Orthogonal Ensemble, because it is invariant under orthogonal conjugation. For any orthogonal matrix OMnO has the same distribution as Mn. To check this, note that OG has the same distribution as G be the rotation invariance of the Gaussian column vectors, and the same is true for OGO−1 by the rotation invariance of the row vectors. To finish note that orthogonal conjugation commutes with symmetrization. If we instead start with a matrix with independent standard complex Gaussian entries, we get the Gaussian Unitary ensemble. To see how the eigenvalues behave, we recall the following classical theorem. Theorem 1.1.1. Suppose Mn has GOE or GUE distribution then Mn has eigenvalue density (1.1.2) f(λ1, ..., λn) = 1 Zn n ∏\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2019-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1090/pcms/026/05\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1090/pcms/026/05","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

这些是2017年PCMI夏季会议上关于随机矩阵的四讲迷你课程的笔记。我们通过取保留其算子结构的极限,而不仅仅是其特征值,来快速介绍大型随机矩阵的理论。算子结构充当精确公式的角色,并允许在一般β-系综的背景下得到结果。在此过程中,我们涵盖了Wiegner半圆定律的非计算证明,对顶部特征值的Füredi-Komlós结果的快速证明,以及BBP相变。1. 1.高斯系综高斯正交系综与酉系综。数学中最早出现随机矩阵的人之一是尤金·维格纳在20世纪50年代提出的。设G是具有独立标准法向分量的n×nmatrix。那么Mn = G+Gt√2。对称矩阵上的这种分布称为高斯正交系综,因为它在正交共轭下是不变的。对于任何正交矩阵,OMnO与Mn具有相同的分布。为了验证这一点,请注意OG具有与G相同的分布,即高斯列向量的旋转不变性,并且OGO−1通过行向量的旋转不变性也是如此。最后要注意正交共轭与对称相违背。如果我们从一个具有独立标准复高斯项的矩阵开始,我们得到高斯酉系综。为了了解特征值的行为,我们回顾一下下面的经典定理。定理1.1.1。假设Mn具有GOE或GUE分布,则Mn具有特征值密度(1.1.2)f(λ1,…, λn) = 1 Zn n∏
本文章由计算机程序翻译,如有差异,请以英文原文为准。
分享
查看原文
A short introduction to operator limits of random matrices
These are notes to a four-lecture minicourse given at the 2017 PCMI Summer Session on Random Matrices. We give a quick introduction to the theory of large random matrices by taking limits that preserve their operator structure, rather than just their eigenvalues. The operator structure takes the role of exact formulas, and allows for results in the context of general β-ensembles. Along the way, we cover a non-computational proof of the Wiegner semicircle law, a quick proofs for the Füredi-Komlós result on the top eigenvalue, as well as the BBP phase transition. 1. The Gaussian Ensembles 1.1. The Gaussian Orthogonal and Unitary Ensembles. One of the earliest appearances of random matrices in mathematics was due to Eugene Wigner in the 1950’s. Let G be an n×nmatrix with independent standard normal entries. Then Mn = G+Gt √ 2 . This distribution on symmetric matrices is called the Gaussian Orthogonal Ensemble, because it is invariant under orthogonal conjugation. For any orthogonal matrix OMnO has the same distribution as Mn. To check this, note that OG has the same distribution as G be the rotation invariance of the Gaussian column vectors, and the same is true for OGO−1 by the rotation invariance of the row vectors. To finish note that orthogonal conjugation commutes with symmetrization. If we instead start with a matrix with independent standard complex Gaussian entries, we get the Gaussian Unitary ensemble. To see how the eigenvalues behave, we recall the following classical theorem. Theorem 1.1.1. Suppose Mn has GOE or GUE distribution then Mn has eigenvalue density (1.1.2) f(λ1, ..., λn) = 1 Zn n ∏
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信