Sparse recovery properties of discrete random matrices

DOI10.1017/S0963548322000256MaRDI QIDQ5885198zbMATH OpenOpenAlexFDO

Authors Asaf Ferber, Ashwin Sah, Mehtaab Sawhney, Yizhe Zhu

Publication date 3 April 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2203.06115

zbMATH Keywords

compressed sensingdiscrete random matrix

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20)

Recommendations

• Sparse recovery with pre-Gaussian random matrices
• Lower bounds for sparse recovery
• Column normalization of a random measurement matrix
• On sparse random combinatorial matrices
• Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling

Cites work

• An algebraic perspective on integer sparse recovery
• An extremal problem for integer sparse recovery
• Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
• Covering point-sets with parallel hyperplanes and sparse signal recovery
• Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
• Estimates for the concentration function of combinatorial number theory and probability
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On a lemma of Littlewood and Offord
• On the counting problem in inverse Littlewood-Offord theory
• On the singularity probability of discrete random matrices
• Resilience of the rank of random matrices
• Singularity of random Bernoulli matrices
• Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
• Six Standard Deviations Suffice
• Spatial Compressive Sensing for MIMO Radar

Cited in

(4)

• Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
• Column normalization of a random measurement matrix
• An extremal problem for integer sparse recovery
• On the linear independence of spikes and sines

This page was built for publication: Sparse recovery properties of discrete random matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885198)