SearcharxivSearch

arXiv · 2502.15892

Sharp estimates for large N Weingarten functions

Abstract

Weingarten functions provide a tool for computing Haar measure matrix integrals of polynomials in the matrix entries. An important property of Weingarten functions, is their particularly simple large $N$ limits. In 2017 Benoit Collins and Sho Matsumoto studied when this limit holds for Weingarten functions associated to integrals of products of $2n$ matrix entries, as $n \to \infty$, together with the matrix size $N$. They showed that the large $N$ limit is uniformly achieved as long as $n=o(N^{4/7})$, a result which already has applications to strong asymptotic freeness. However, their result is not optimal. They conjectured that their result should actually hold up to $n=o(N^{2/3})$ which is optimal. We prove this conjecture for the matrix groups $G \in \{\mathrm{U}(N)$, $\mathrm{O}(N)$, $\mathrm{Sp}(N)\}$. The proof proceeds by introducing a Markov process on permutations (pairings) which we call the unitary (orthogonal) $\textit{Weingarten process}$. We believe this process may have further applications to the theory of Weingarten functions. We also prove two new bounds regarding the large $N$ limit of the Weingarten function in the regimes when $n=o(N^{4/5})$, and $n=o(N)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ron Nissim. 2025-02-21. Sharp estimates for large N Weingarten functions. https://arxiv.org/abs/2502.15892

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR