${\ell }_p$-Spread and Restricted Isometry Properties of Sparse Random Matrices

Abstract

Random subspaces $X$ of ${\mathbb{R}}^n$ of dimension proportional to $n$ are, with high probability, well-spread with respect to the ${\ell }_2$-norm. Namely, every nonzero $x\in X$ is "robustly non-sparse" in the following sense: $x$ is $\epsilon \Vert x{\Vert }_2$-far in ${\ell }_2$-distance from all $\delta n$-sparse vectors, for positive constants $\epsilon ,\delta$ bounded away from $0$. This "${\ell }_2$-spread" property is the natural counterpart, for subspaces over the reals, of the minimum distance of linear codes over finite fields, and corresponds to $X$ being a Euclidean section of the ${\ell }_1$ unit ball. Explicit ${\ell }_2$-spread subspaces of dimension $\Omega (n)$, however, are unknown, and the best known constructions (which achieve weaker spread properties), are analogs of low density parity check (LDPC) codes over the reals, i.e., they are kernels of sparse matrices. We study the spread properties of the kernels of sparse random matrices. Rather surprisingly, we prove that with high probability such subspaces contain vectors $x$ that are $o(1)\cdot \Vert x{\Vert }_2$-close to $o(n)$-sparse with respect to the ${\ell }_2$-norm, and in particular are not ${\ell }_2$-spread. On the other hand, for $p<2$ we prove that such subspaces are ${\ell }_p$-spread with high probability. Moreover, we show that a random sparse matrix has the stronger restricted isometry property (RIP) with respect to the ${\ell }_p$ norm, and this follows solely from the unique expansion of a random biregular graph, yielding a somewhat unexpected generalization of a similar result for the ${\ell }_1$ norm [BGI+08]. Instantiating this with explicit expanders, we obtain the first explicit constructions of ${\ell }_p$-RIP matrices for $1\le p<p_0$, where $1<p_0<2$ is an absolute constant.

References in corpus (9)

• Community detection in graphs
• Cutoff phenomena for random walks on random regular graphs
• Universal Matrix Completion
• Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem
• Equitable random graphs
• The Relativized Second Eigenvalue Conjecture of Alon
• Invertibility of adjacency matrices for random $d$-regular graphs
• Matrix Completion from $O(n)$ Samples in Linear Time
• Spectral partitioning in equitable graphs

Cited by in corpus (6)

• Ramanujan complexes and Golden Gates in PU(3)
• Scalable Bayesian computation for crossed and nested hierarchical models
• Partially factorized variational inference for high-dimensional mixed models
• On the second eigenvalue of random bipartite biregular graphs
• Global eigenvalue fluctuations of random biregular bipartite graphs
• Extreme singular values of inhomogeneous sparse random rectangular matrices