arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.00300math.PRmath-phmath.COmath.MPmath.STstat.TH
收藏

Wigner矩阵边普适性的一种新组合方法

A new combinatorial approach for edge universality of Wigner matrices

Debapratim Banerjee

摘要:

本文提出了一种新的组合方法来分析Wigner矩阵的大幂次迹。我们的方法是从\citet{sosh}的论文动机。但计算方法不同。我们从类似于\citet{AZ05}的经典单词句子方法开始,从\citet{sinaisosh}、\citet{sosh}和\citet{peche2009universality}中提取动机,将单词编码为类似于Dyck路径的对象。更精确地说,该映射将一个字映射到一条Dyck路径上,并从中去掉一些边。利用这种新的计数方法,我们证明了具有亚高斯项的大型Wigner矩阵的边的普适性。这种方法的一个新颖之处在于,与\citet{sinaisosh}、\citet{sosh}和\citet{peche2009universality}不同,我们不需要假设矩阵的元素围绕$0$对称分布。本文的主要技术贡献有两个方面。首先,我们产生维格纳矩阵的"贡献词”的编码(对于定义,可以查看\ref{sec:word}部分),其检索边缘通用性。因此,这是最好的一个可以做的。我们希望这种方法将适用于许多其他情况下的随机矩阵。其次,在本文的过程中,我们给出了一个组合描述的GOE特雷西Widom法律。对GUE的解释非常相似。这种解释可能是重要的模型,精确的计算是不可用的,但一些组合结构。

英文摘要:

In this paper we introduce a new combinatorial approach to analyze the trace of large powers of Wigner matrices. Our approach is motivated from the paper by \citet{sosh}. However the counting approach is different. We start with classical word sentence approach similar to \citet{AZ05} and take the motivation from \citet{sinaisosh}, \citet{sosh} and \citet{peche2009universality} to encode the words to objects similar to Dyck paths. To be precise the map takes a word to a Dyck path with some edges removed from it. Using this new counting we prove edge universality for large Wigner matrices with sub-Gaussian entries. One novelty of this approach is unlike \citet{sinaisosh}, \citet{sosh} and \citet{peche2009universality} we do not need to assume the entries of the matrices are symmetrically distributed around $0$. The main technical contribution of this paper is two folded. Firstly we produce an encoding of the ``contributing words" (for definition one might look at Section \ref{sec:word}) of the Wigner matrix which retrieves the edge universality. Hence this is the best one can do. We hope this method will be applicable to many other scenarios in random matrices. Secondly in course of the paper we give a combinatorial description of the GOE Tracy Widom law. The explanation for GUE is very similar. This explanation might be important for the models where exact calculations are not available but some combinatorial structures are present.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑