English

Approximately Hadamard matrices and Riesz bases in random frames

Probability 2023-03-10 v2 Numerical Analysis Numerical Analysis

Abstract

An n×nn \times n matrix with ±1\pm 1 entries which acts on Rn\mathbb{R}^n as a scaled isometry is called Hadamard. Such matrices exist in some, but not all dimensions. Combining number-theoretic and probabilistic tools we construct matrices with ±1\pm 1 entries which act as approximate scaled isometries in Rn\mathbb{R}^n for all nn. More precisely, the matrices we construct have condition numbers bounded by a constant independent of nn. Using this construction, we establish a phase transition for the probability that a random frame contains a Riesz basis. Namely, we show that a random frame in Rn\mathbb{R}^n formed by NN vectors with independent identically distributed coordinates having a non-degenerate symmetric distribution contains many Riesz bases with high probability provided that Nexp(Cn)N \ge \exp(Cn). On the other hand, we prove that if the entries are subgaussian, then a random frame fails to contain a Riesz basis with probability close to 11 whenever Nexp(cn)N \le \exp(cn), where c<Cc<C are constants depending on the distribution of the entries.

Keywords

Cite

@article{arxiv.2207.07523,
  title  = {Approximately Hadamard matrices and Riesz bases in random frames},
  author = {Xiaoyu Dong and Mark Rudelson},
  journal= {arXiv preprint arXiv:2207.07523},
  year   = {2023}
}
R2 v1 2026-06-25T00:57:01.065Z