Journal ArticleOPEN ACCESS

On the rank of random sparse matrices

Combinatorics Probability and Computing (2010) 19(3) 321-342
DOI: 10.1017/S0963548309990447
19Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

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. © 2009 Cambridge University Press.

Cite

CITATION STYLE

APA

Costello, K. P., & Vu, V. (2010). On the rank of random sparse matrices. Combinatorics Probability and Computing, 19(3), 321–342. https://doi.org/10.1017/S0963548309990447

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free