The rank of sparse random matrices

06/13/2019
by   Amin Coja-Oghlan, et al.
0

Generalising prior work on the rank of random matrices over finite fields [Coja-Oghlan and Gao 2018], we determine the rank of a random matrix with prescribed numbers of non-zero entries in each row and column over any field. The rank formula turns out to be independent of both the field and the distribution of the non-zero matrix entries. The proofs are based on a blend of algebraic and probabilistic methods inspired by ideas from mathematical physics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/17/2018

The rank of random matrices over finite fields

We determine the rank of a random matrix A over a finite field with pres...
research
12/28/2021

The full rank condition for sparse random matrices

We derive a sufficient condition for a sparse random matrix with given n...
research
01/23/2023

The k-XORSAT threshold revisited

We provide a simplified proof of the random k-XORSAT satisfiability thre...
research
07/22/2022

Ladder Matrix Recovery from Permutations

We give unique recovery guarantees for matrices of bounded rank that hav...
research
02/21/2017

Column normalization of a random measurement matrix

In this note we answer a question of G. Lecué, by showing that column no...
research
05/06/2020

Rigid Matrices From Rectangular PCPs

We introduce a variant of PCPs, that we refer to as rectangular PCPs, wh...
research
11/03/2020

Near-Optimal Entrywise Sampling of Numerically Sparse Matrices

Many real-world data sets are sparse or almost sparse. One method to mea...

Please sign up or login with your details

Forgot password? Click here to reset