SearcharxivSearch

arXiv · 2106.08953

Gaussian distributions on Riemannian symmetric spaces, random matrices, and planar Feynman diagrams

Also available from

Abstract

Gaussian distributions can be generalized from Euclidean space to a wide class of Riemannian manifolds. Gaussian distributions on manifolds are harder to make use of in applications since the normalisation factors, which we will refer to as partition functions, are complicated, intractable integrals in general that depend in a highly non-linear way on the mean of the given distribution. Nonetheless, on Riemannian symmetric spaces, the partition functions are independent of the mean and reduce to integrals over finite dimensional vector spaces. These are generally still hard to compute numerically when the dimension (more precisely the rank $N$) of the underlying symmetric space gets large. On the space of positive definite Hermitian matrices, it is possible to compute these integrals exactly using methods from random matrix theory and the so-called Stieltjes-Wigert polynomials. In other cases of interest to applications, such as the space of symmetric positive definite (SPD) matrices or the Siegel domain (related to block-Toeplitz covariance matrices), these methods seem not to work quite as well. Nonetheless, it remains possible to compute leading order terms in a large $N$ limit, which provide increasingly accurate approximations as $N$ grows. This limit is inspired by realizing a given partition function as the partition function of a zero-dimensional quantum field theory or even Chern-Simons theory. From this point of view the large $N$ limit arises naturally and saddle-point methods, Feynman diagrams, and certain universalities that relate different spaces emerge.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Simon Heuveline, Salem Said, Cyrus Mostajeran. 2021-06-02. Gaussian distributions on Riemannian symmetric spaces, random matrices, and planar Feynman diagrams. https://doi.org/10.1109/tit.2022.3199479

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