Sparse recovery properties of discrete random matrices
From MaRDI portal
Publication:5885198
DOI10.1017/S0963548322000256OpenAlexW4221162723MaRDI QIDQ5885198
Yizhe Zhu, Ashwin Sah, Asaf Ferber, Mehtaab Sawhney
Publication date: 3 April 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.06115
Cites Work
- On the singularity probability of discrete random matrices
- An algebraic perspective on integer sparse recovery
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- An extremal problem for integer sparse recovery
- Singularity of random Bernoulli matrices
- Covering point-sets with parallel hyperplanes and sparse signal recovery
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Six Standard Deviations Suffice
- Estimates for the concentration function of combinatorial number theory and probability
- Spatial Compressive Sensing for MIMO Radar
- Deterministic Constructions of Binary Measurement Matrices From Finite Geometry
- Resilience of the rank of random matrices
- On the counting problem in inverse Littlewood–Offord theory
- SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
- On a lemma of Littlewood and Offord
This page was built for publication: Sparse recovery properties of discrete random matrices