SearcharxivSearch

arXiv · 2404.14144

Universality of the Wigner-Gurau limit for random tensors

Abstract

In this article, we develop a combinatorial approach for studying moments of the resolvent trace for random tensors proposed by Razvan Gurau. Our work is based on the study of hypergraphs and extends the combinatorial proof of moments convergence for Wigner's theorem. This also opens up paths for research akin to free probability for random tensors. \\ Specifically, trace invariants form a complete family of tensor invariants and constitute the moments of the resolvent trace. For a random tensor with entries independent, centered, with the right variance and bounded moments, we prove the convergence of the expectation and bound the variance of the balanced single trace invariant. This is the universality of the convergence of the moments of the tensor towards the limiting moments given by the Fuss-Catalan numbers, which are the moments of the law obtained by Gurau in the Gaussian case. This generalizes Wigner's theorem for random tensors. \\ Additionally, in the Gaussian case, we show that the limiting distribution of the moments of the $k$-times contracted $p$-order random tensor by a deterministic vector is always the one of a dilated Wigner-Gurau law at order $p-k$. This establishes a connection with the approach of random tensors through study of the matrices given by the $p-2$ contractions of the tensor.

Explore related subjects

Keep this discovery

BibTeXRIS

Remi Bonnin. 2024-04-22. Universality of the Wigner-Gurau limit for random tensors. https://doi.org/10.1214/26-ejp1500

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