2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/142365We 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.24 pagesProbabilityCombinatorics15A52, 60C05text