Ultra high order cumulants and quantitative CLT for polynomials in random matrices

Abstract From the study of the high order freeness of random matrices, it is known that the order r cumulant of the trace of a polynomial of N -dimensional GUE/GOE is of order $$N^{2-r}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>N</mml:mi> <mml:mrow> <mml:mn>2</mml:mn> <mml:mo>-</mml:mo> <mml:mi>r</mml:mi> </mml:mrow> </mml:msup> </mml:math> if r is fixed. In this work, we extend the study along three directions. First, we also consider generally distributed Wigner matrices with subexponential entries. Second, we include the deterministic matrices into discussion and consider arbitrary polynomials in random matrices and deterministic matrices. Third, more importantly, we consider the ultra high order cumulants in the sense that r is arbitrary, i.e., could be N dependent. Our main results are the upper bounds of the ultra high order cumulants, for which not only the N -dependence but also the r -dependence becomes significant. These results are then used to derive three types of quantitative CLT for the trace of any given self-adjoint polynomial in these random matrix variables: a CLT with a Cramér type correction, a Berry–Esseen bound, and a concentration inequality which captures both the Gaussian tail in the small deviation regime and M -dependent tail in the large deviation regime, where M is the degree of the polynomial. In contrast to the second order freeness which implies the CLT for linear eigenvalue statistics of polynomials in random matrices, our study on the ultra high order cumulants leads to the quantitative versions of the CLT.

Authors

Institutions

Publication Details

Journal
Probability Theory and Related Fields
Published
2025-11-08
DOI
https://doi.org/10.1007/s00440-025-01446-w
Primary Topic
Random Matrices and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Ultra high order cumulants and quantitative CLT for polynomials in random matrices

Zhigang Bao, Daniel George
Probability Theory and Related Fields
Random Matrices and Applications
article

Ultra high order cumulants and quantitative CLT for polynomials in random matrices

Zhigang Bao, Daniel George
article en

Abstract

Abstract From the study of the high order freeness of random matrices, it is known that the order r cumulant of the trace of a polynomial of N -dimensional GUE/GOE is of order $$N^{2-r}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mi>N</mml:mi> <mml:mrow> <mml:mn>2</mml:mn> <mml:mo>-</mml:mo> <mml:mi>r</mml:mi> </mml:mrow> </mml:msup> </mml:math> if r is fixed. In this work, we extend the study along three directions. First, we also consider generally distributed Wigner matrices with subexponential entries. Second, we include the deterministic matrices into discussion and consider arbitrary polynomials in random matrices and deterministic matrices. Third, more importantly, we consider the ultra high order cumulants in the sense that r is arbitrary, i.e., could be N dependent. Our main results are the upper bounds of the ultra high order cumulants, for which not only the N -dependence but also the r -dependence becomes significant. These results are then used to derive three types of quantitative CLT for the trace of any given self-adjoint polynomial in these random matrix variables: a CLT with a Cramér type correction, a Berry–Esseen bound, and a concentration inequality which captures both the Gaussian tail in the small deviation regime and M -dependent tail in the large deviation regime, where M is the degree of the polynomial. In contrast to the second order freeness which implies the CLT for linear eigenvalue statistics of polynomials in random matrices, our study on the ultra high order cumulants leads to the quantitative versions of the CLT.

Probability Theory and Related Fields
University of Hong Kong (HK)
National Natural Science Foundation of China
Openalex Percentile: Top 69%
Random Matrices and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Ultra high order cumulants and quantitative CLT for polynomials in random matrices — Zhigang Bao, Daniel George · Probability Theory and Related Fields (2025) | TGRS Research Map | TGRS