The full rank condition for sparse random matrices

Simple item page
dc.contributor.authorCoja-Oghlan, Amin
dc.contributor.authorGao, Pu
dc.contributor.authorHahn-Klimroth, Max
dc.contributor.authorLee, Joon
dc.contributor.authorMüller, Noela
dc.contributor.authorRolvien, Maurice
dc.date.accessioned2025-09-15T12:30:21Z
dc.date.available2025-09-15T12:30:21Z
dc.date.issued2024-09-20
dc.description.abstractWe derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and {0,1}-matrices over the rationals. The sufficient condition is generally necessary as well.en
dc.identifier.urihttp://hdl.handle.net/2003/43969
dc.language.isoen
dc.relation.ispartofseriesCombinatorics, probability & computing; 33(5)
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectRandom matrixen
dc.subjectRanken
dc.subject.ddc004
dc.titleThe full rank condition for sparse random matricesen
dc.typeText
dc.type.publicationtypeArticle
dcterms.accessRightsopen access
eldorado.dnb.deposittrue
eldorado.doi.registerfalse
eldorado.secondarypublicationtrue
eldorado.secondarypublication.primarycitationCoja-Oghlan A, Gao P, Hahn-Klimroth M, Lee J, Müller N, Rolvien M. The full rank condition for sparse random matrices. Combinatorics, Probability and Computing. 2024;33(5):643-707. doi:10.1017/S096354832400021X
eldorado.secondarypublication.primaryidentifierhttps://doi.org/10.1017/S096354832400021X

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
the-full-rank-condition-for-sparse-random-matrices.pdf
Size:
1.31 MB
Format:
Adobe Portable Document Format
Description:
DNB
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.82 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

LS 02 Komplexitätstheorie und Effiziente Algorithmen