Rank of near uniform matrices

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 Mat(Fq) 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 GLn(Fq): subtracting the identity or taking a minor of a uniformly sampled invertible matrix.