Approximately Hadamard matrices and Riesz bases in random frames

07/15/2022
by   Xiaoyu Dong, et al.
0

An n × n matrix with ± 1 entries which acts on ℝ^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 entries which act as approximate scaled isometries in ℝ^n for all n. More precisely, the matrices we construct have condition numbers bounded by a constant independent of n. 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 ℝ^n formed by N vectors with independent identically distributed coordinates having a non-degenerate symmetric distribution contains many Riesz bases with high probability provided that N ≥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 1 whenever N ≤exp(cn), where c<C are constants depending on the distribution of the entries.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/13/2022

Sparsity and ℓ_p-Restricted Isometry

A matrix A is said to have the ℓ_p-Restricted Isometry Property (ℓ_p-RIP...
research
03/03/2023

GMRES, pseudospectra, and Crouzeix's conjecture for shifted and scaled Ginibre matrices

We study the GMRES algorithm applied to linear systems of equations invo...
research
05/19/2020

Random Toeplitz Matrices: The Condition Number under High Stochastic Dependence

In this paper, we study the condition number of a random Toeplitz matrix...
research
05/18/2020

On the real Davies' conjecture

We show that every matrix A ∈R^n× n is at least δ A-close to a real ...
research
10/30/2019

Balancing Gaussian vectors in high dimension

Motivated by problems in controlled experiments, we study the discrepanc...
research
09/11/2019

Unified ℓ_2→∞ Eigenspace Perturbation Theory for Symmetric Random Matrices

Modern applications in statistics, computer science and network science ...
research
06/27/2023

Uniform density in matroids, matrices and graphs

We give new characterizations for the class of uniformly dense matroids,...

Please sign up or login with your details

Forgot password? Click here to reset