English

Improved RIP Bounds for Gaussian Partial Circulant Matrices

Data Structures and Algorithms 2026-07-30 v1 Probability

Abstract

We prove an improved restricted isometry bound for Gaussian partial circulant matrices with arbitrary prescribed sampling sets. There is a universal constant C>0C>0 such that the following holds. Let 1KmN1\leq K\leq m\leq N be positive integers, let ΩZN\Omega\subset\mathbb Z_N be any fixed set with Ω=m|\Omega|=m, and let gN(0,IN)g\sim\mathcal N(0,I_N). For every δ,η(0,1)\delta,\eta\in(0,1), the normalized partial circulant matrix generated by gg has the RIP of order KK with constant at most δ\delta, with probability at least 1η1-\eta over the draw of gg, provided mCδ2Kmax{log2(eK)log(2N)log(em),log(2/η)}. m\geq C\delta^{-2}K \max\{\log^2(eK)\log(2N)\log(em),\log(2/\eta)\}. The proof refines the Maurey entropy step in the chaos-process argument by combining a noncommutative Khintchine inequality with a Schatten moment estimate controlled by mm, replacing one factor log(2N)\log(2N) in the Krahmer--Mendelson--Rauhut bound by log(em)\log(em).

Cite

@article{arxiv.2607.27676,
  title  = {Improved RIP Bounds for Gaussian Partial Circulant Matrices},
  author = {Zhao Song},
  journal= {arXiv preprint arXiv:2607.27676},
  year   = {2026}
}