Sparse recovery properties of discrete random matrices

Abstract

Motivated by problems from compressed sensing, we determine the threshold behavior of a random $n\times d$ $\pm 1$ matrix $M_{n,d}$ with respect to the property "every $s$ columns are linearly independent". In particular, we show that for every $0<\delta <1$ and $s=(1-\delta )n$, if $d\le n^{1+1/2(1-\delta )-o(1)}$ then with high probability every $s$ columns of $M_{n,d}$ are linearly independent, and if $d\ge n^{1+1/2(1-\delta )+o(1)}$ then with high probability there are some $s$ linearly dependent columns.

References in corpus (2)

• Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
• Resilience of the Rank of Random Matrices