On the Rank of Random Sparse Matrices

KEVIN P. COSTELLO, VAN VU

Source record

Source: Crossref

Published: Oct 12, 2009

DOI: 10.1017/s0963548309990447

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.