The rank of sparse random matrices

Amin Coja-Oghlan, Alperen A. Ergür, Pu Gao, Samuel Hetterich, Maurice Rolvien

We determine the rank of a random matrix over an arbitrary field with prescribed numbers of non-zero 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.

Knowledge Graph



Sign up or login to leave a comment