SearcharxivSearch

arXiv · 1712.04772

Random non-Abelian G-circulant matrices. Spectrum of random convolution operators on large finite groups

Abstract

We analyse the limiting behavior of the eigenvalue and singular value distribution for random convolution operators on large (not necessarily Abelian) groups, extending the results by M. Meckes for the Abelian case. We show that for regular sequences of groups the limiting distribution of eigenvalues (resp. singular values) is a mixture of eigenvalue (resp. singular value) distributions of Ginibre matrices with the directing measure being related to the limiting behavior of the Plancherel measure of the sequence of groups. In particular for the sequence of symmetric groups, the limiting distributions are just the circular and quarter circular laws, whereas e.g. for the dihedral groups the limiting distributions have unbounded supports but are different than in the Abelian case. We also prove that under additional assumptions on the sequence of groups (in particular for symmetric groups of increasing order) families of stochastically independent random projection operators converge in moments to free circular elements. Finally, in the Gaussian case we provide Central Limit Theorems for linear eigenvalue statistics.

Explore related subjects

Keep this discovery

BibTeXRIS

Radosław Adamczak. 2017-12-13. Random non-Abelian G-circulant matrices. Spectrum of random convolution operators on large finite groups. https://arxiv.org/abs/1712.04772

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