Rank of Near Uniform Matrices

Jake Koenig; Hoi Nguyen

Home/Archive/arXiv

arXiv · 2101.00107

Rank of Near Uniform Matrices

Jake Koenig·Hoi Nguyen

View original source ↗Read source document ↗Export metadata ↓

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 $\operatorname{Mat}(\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.

Explore related subjects

math.PR math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Jake Koenig, Hoi Nguyen. 2021-01-11. Rank of Near Uniform Matrices. https://arxiv.org/abs/2101.00107

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Villani's conjecture for Kac's walk

We prove Villani's conjecture on entropy production for Kac's walk with uniform collision angles. For every $N\geq2$, with total collision rate $N$, the optimal entropy production constant is $2/(N-1)$. We show that the known lower bound is sharp by constructing two families of smooth strictly positive probability densities, invariant under coordinate permutations and sign changes. The first consists of normalized products of inverse powers; the second is obtained by conditioning products of Gaussian mixtures on the energy sphere. With $N$ fixed, we compute the leading terms of entropy and entropy production. Successive parameter limits yield two independent proofs of sharpness.

math.PR↗

arXiv2026

Scaling limit and tail bounds for a random walk model of SOS level lines

This paper analyzes a random walk model for the level lines appearing in the entropic repulsion phenomena of three-dimensional discrete random interfaces above a hard wall; we are particularly motivated by the low-temperature (2+1)D solid-on-solid (SOS) model, where the emergence of these level lines has been rigorously established. The model we consider is a line ensemble of non-crossing random walk bridges above a wall with geometrically growing area tilts. Our main result, which in particular resolves a question of Caputo, Ioffe, and Wachtel (2019), is an edge 1:2:3 scaling limit for this ensemble as the domain size diverges, with a growing number of walks (including the number of level lines of the SOS model) and high boundary conditions (covering the maximum upper deviation of the SOS level lines). As a key input, we establish Tracy--Widom-type upper tail bounds for each of the relevant curves in the line ensemble. An ingredient which may be of independent interest is a ballot theorem for random walk bridges under a broader range of boundary values than available in the literature.

math.PR↗

arXiv2026

One-dimensional particle clouds with elastic collisions

We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it tries to jump left, the jump is executed. If not, 'momentum' is transferred to increase the rate of jumping left of the minimal-label particle. Similarly for jumps to the right. The collision rule is 'elastic' in the sense that the net rate of flow of mass is independent of the present configuration, in contrast to the exclusion process, for example. We show that the particle masses and jump rates determine explicitly, via a concave majorant of a simple `potential' function associated to the masses and jump rates, a unique partition of the system into maximal stable subsystems. The internal configuration of each stable subsystem remains tight, while the location of each stable subsystem obeys a strong law of large numbers with an explicit speed. We indicate connections to adjacent models, including diffusions with rank-based coefficients, where, to the authors' knowledge, the problem of identifying the analogous decomposition into stable sub-systems is yet to be fully solved.

math.PR↗