Search arXivSearch

arXiv · 2011.09356

Limits and fluctuations of $p$-adic random matrix products

Abstract

We show that singular numbers (also known as invariant factors or Smith normal forms) of products and corners of random matrices over $\mathbb{Q}_p$ are governed by the Hall-Littlewood polynomials, in a structurally identical manner to the classical relations between singular values of complex random matrices and Heckman-Opdam hypergeometric functions. This implies that the singular numbers of a product of corners of Haar-distributed elements of $\text{GL}_N(\mathbb{Z}_p)$ form a discrete-time Markov chain distributed as a Hall-Littlewood process, with the number of matrices in the product playing the role of time. We give an exact sampling algorithm for the Hall-Littlewood processes which arise by relating them to an interacting particle system similar to PushTASEP. By analyzing the asymptotic behavior of this particle system, we show that the singular numbers of such products obey a law of large numbers and their fluctuations converge dynamically to independent Brownian motions. In the limit of large matrix size, we also show that the analogues of the Lyapunov exponents for matrix products have universal limits within this class of $\text{GL}_N(\mathbb{Z}_p)$ corners.

Explore related subjects

Keep this discovery

BibTeXRIS

Roger Van Peski. 2020-11-18. Limits and fluctuations of $p$-adic random matrix products. https://doi.org/10.1007/s00029-021-00709-3

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