SearcharxivSearch

arXiv · 2005.09775

Random Toeplitz Matrices: The Condition Number under High Stochastic Dependence

Abstract

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 a circulant embedding, 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 circulant matrix of dimension $n$ under the existence of moment generating function of the random entries is $\kappa\left(\mathcal{C}_n\right) = \mbox{O}\left( \frac{1}{\varepsilon} n^{\rho+1/2} \left(\log n\right)^{1/2} \right)$ with probability $1-\mbox{O}\left((\varepsilon^2 + \varepsilon) n^{-2\rho} + n^{-1/2+\scriptstyle{o}(1)}\right)$ for any $\varepsilon >0$, $\rho\in(0,1/4)$. Moreover, if the random entries only have the second moment, we have $\kappa\left(\mathcal{C}_n\right) = \mbox{O}\left( \frac{1}{\varepsilon} n^{\rho+1/2} \log n\right)$ with probability $1-\mbox{O}\left((\varepsilon^2 + \varepsilon) n^{-2\rho} + \left(\log n\right)^{-1/2}\right)$. For the condition number of a random (non--symmetric or symmetric) Toeplitz matrix $\mathcal{T}_n$ we establish $\kappa\left(\mathcal{T}_n\right) \leq \kappa\left(\mathcal{C}_{2n}\right) \left(\sigma_{\min}\left( C_{2n} \right)\sigma_{\min}\left( S_n \right)\right)^{-1}$, where $\sigma_{\min}(A)$ is the minimum singular value of the matrix $A$. The matrix $C_{2n}$ is a random circulant matrix and $S_n:=F^*_{2,n} D_{1,n}^{-1}F_{2,n} + F^*_{4,n} D^{-1}_2 F_{4,n}$, where $F_{2,n},F_{4,n}$ are deterministic matrices and $D_{1,n}, D_{2,n}$ are random diagonal matrices. We conjeture $S_n$ is well conditioned.

Explore related subjects

Keep this discovery

BibTeXRIS

Paulo Manrique--Mirón. 2020-05-19. Random Toeplitz Matrices: The Condition Number under High Stochastic Dependence. https://arxiv.org/abs/2005.09775

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR