On the Rank of Random Sparse Matrices
classification
🧮 math.PR
math.CO
keywords
matricesrandomranksparseallowsco-rankcontainsdependency
read the original abstract
We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This allows us to obtain an exact estimate for the co-rank.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.