On the Rank of Random Sparse Matrices

Simple item page
dc.creatorCostello, Kevin P.
dc.creatorVu, Van
dc.date2007-11-16
dc.date.accessioned2026-07-07T08:43:35Z
dc.date.available2026-07-07T08:43:35Z
dc.descriptionWe 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.
dc.description24 pages
dc.identifierhttps://arxiv.org/abs/0711.2696
dc.identifierhttp://arxiv.org/abs/0711.2696
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142365
dc.subjectProbability
dc.subjectCombinatorics
dc.subject15A52, 60C05
dc.titleOn the Rank of Random Sparse Matrices
dc.typetext

Files

Collections

arXiv