The full rank condition for sparse random matrices

12/28/2021
by   Amin Coja-Oghlan, et al.
0

We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and {0,1}-matrices over the rationals. The sufficient condition is generally necessary as well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2019

The rank of sparse random matrices

Generalising prior work on the rank of random matrices over finite field...
research
05/19/2020

Random Toeplitz Matrices: The Condition Number under High Stochastic Dependence

In this paper, we study the condition number of a random Toeplitz matrix...
research
04/21/2011

Rank Minimization over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations

This paper establishes information-theoretic limits in estimating a fini...
research
08/07/2020

The Tensor Quadratic Forms

We consider the following data perturbation model, where the covariates ...
research
11/19/2013

Near-Optimal Entrywise Sampling for Data Matrices

We consider the problem of selecting non-zero entries of a matrix A in o...
research
12/19/2018

On the entropy of coverable subshifts

A coloration w of Z^2 is said to be coverable if there exists a rectangu...
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...

Please sign up or login with your details

Forgot password? Click here to reset