Random Toeplitz Matrices: The Condition Number under High Stochastic Dependence

05/19/2020
by   Paulo Manrique--Mirón, et al.
0

In this paper, we study the condition number of a random Toeplitz matrix. Since a Toeplitz matrix is a diagonal constant matrix, its rows or columns cannot be stochastically independent. This situation does not permit us to use the classic strategy to analyze its minimum singular value when all the entries of a random matrix are stochastically independent. Using Cauchy Interlacing Theorem as a decoupling technique, we can break the stochastic dependence of the structure of the Toeplitz matrix and reduce the problem to analyze the extreme singular values of a random circulant matrix. Among our results, we show the condition number of non–symmetric random Toeplitz matrix of dimension n under the existence of moment generating function of the random entries is κ(T_n) = ( 1/ε n^ρ+1/2(log n)^1/2) with probability 1-((ε^2 + ε) n^-2ρ + n^-1/2+o(1)) for any ε >0, ρ∈(0,1/4). Moreover, if the random entries only have the second moment, we have κ(T_n) = ( 1/ε n^ρ+1/2log n) with probability 1-((ε^2 + ε) n^-2ρ + (log n)^-1/2). Also, Cauchy Interlacing Theorem permits to analyze the condition number of a symmetric random Toeplitz matrix. In this case, the condition number κ( T^sym_n) = (1/ε n^1.01(log n)^1/2) with probability 1- ( ε n^-1/10 + n^-77/300+o(1)), when the random entries have moment generating function. Additionally, we show that the results on the random Toeplitz matrices hold for random Hankel matrices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2021

The full rank condition for sparse random matrices

We derive a sufficient condition for a sparse random matrix with given n...
research
01/08/2021

On the Recognition of Strong-Robinsonian Incomplete Matrices

A matrix is incomplete when some of its entries are missing. A Robinson ...
research
07/12/2023

Ellipsoid Fitting Up to a Constant

In [Sau11,SPW13], Saunderson, Parrilo and Willsky asked the following el...
research
09/26/2020

The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes

Frank-Wolfe methods are popular for optimization over a polytope. One of...
research
07/15/2022

Approximately Hadamard matrices and Riesz bases in random frames

An n × n matrix with ± 1 entries which acts on ℝ^n as a scaled isometry ...
research
01/12/2022

Eigenvalue Distribution of Large Random Matrices Arising in Deep Neural Networks: Orthogonal Case

The paper deals with the distribution of singular values of the input-ou...
research
08/07/2020

The Tensor Quadratic Forms

We consider the following data perturbation model, where the covariates ...

Please sign up or login with your details

Forgot password? Click here to reset