Rank of near uniform matrices

DOI10.4310/JOC.2022.V13.N3.A4MaRDI QIDQ2122505zbMATH OpenFDO

Authors Yanyan Li

Publication date 6 April 2022

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.00107

zbMATH Keywords

random matrix theoryrank statistics

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20) Asymptotic properties of parametric tests (62F05)

Abstract: A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the behavior occurs for a larger class of random variables. The rank statistics of random matrices chosen uniformly from $operatornameMat(mathbf{F}_q)$ over a finite field are well understood. The universality properties of these statistics are not yet fully understood however. Recently Wood [39] and Maples [26] considered a natural requirement where the random variables are not allowed to be too close to constant and they showed that the rank statistics match with the uniform model up to an error of type $e^{-cn}$. In this paper we explore a condition called near uniform, under which we are able to prove tighter bounds $q^{-cn}$ on the asymptotic convergence of the rank statistics. Our method is completely elementary, and allows for a small number of the entries to be deterministic, and for the entries to not be identically distributed so long as they are independent. More importantly, the method also extends to near uniform symmetric, alternating matrices. Our method also applies to two models of perturbations of random matrices sampled uniformly over $operatorname{GL}_n(mathbf{F}_q)$: subtracting the identity or taking a minor of a uniformly sampled invertible matrix.

Recommendations

• Non-asymptotic bounds for probabilities of the rank of a random matrix over a finite field
• Stein's method and the rank distribution of random matrices over finite fields
• Some new results in random matrices over finite fields
• The rank of sparse random matrices over finite fields
• scientific article; zbMATH DE number 1545673

Cited in

(5)

• Four deviations suffice for rank 1 matrices
• Unitary rank structured matrices
• The rank of a warping matrix
• Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
• Local and global universality of random matrix cokernels

This page was built for publication: Rank of near uniform matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2122505)