Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Coja-Oghlan, Amin | - |
dc.contributor.author | Ergür, Alperen A. | - |
dc.contributor.author | Gao, Pu | - |
dc.contributor.author | Hetterich, Samuel | - |
dc.contributor.author | Rolvien, Maurice | - |
dc.date.accessioned | 2024-02-21T14:01:20Z | - |
dc.date.available | 2024-02-21T14:01:20Z | - |
dc.date.issued | 2022-04-23 | - |
dc.identifier.uri | http://hdl.handle.net/2003/42342 | - |
dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-24179 | - |
dc.description.abstract | We determine the asymptotic normalized rank of a random matrix A over an arbitrary field with prescribed numbers of nonzero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula vindicates a conjecture of Lelarge (2013). The proofs are based on coupling arguments and a novel random perturbation, applicable to any matrix, that diminishes the number of short linear relations. | en |
dc.language.iso | en | de |
dc.relation.ispartofseries | Random structures & algorithms;62(1) | - |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | de |
dc.subject | Finite field | en |
dc.subject | Random constraint satisfaction | en |
dc.subject | Random matrices | en |
dc.subject | Rank | en |
dc.subject | Sparse matrices | en |
dc.subject.ddc | 004 | - |
dc.title | The rank of sparse random matrices | en |
dc.type | Text | de |
dc.type.publicationtype | ResearchArticle | de |
dcterms.accessRights | open access | - |
eldorado.secondarypublication | true | de |
eldorado.secondarypublication.primaryidentifier | https://doi.org/10.1002/rsa.21085 | de |
eldorado.secondarypublication.primarycitation | A. Coja-Oghlan, A. A. Ergür, P. Gao, S. Hetterich, M. Rolvien, The rank of sparse random matrices, Random Struct. Algorithms. 62 (2023), 68–130. https://doi.org/10.1002/rsa.21085 | de |
Appears in Collections: | LS 02 Komplexitätstheorie und Effiziente Algorithmen |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Random Struct Algorithms - 2022 - Coja‐Oghlan - The rank of sparse random matrices.pdf | DNB | 2.29 MB | Adobe PDF | View/Open |
This item is protected by original copyright |
This item is licensed under a Creative Commons License