Suppose that $T_n$ is a Toeplitz matrix whose entries come from a sequence of independent but not necessarily identically distributed random variables with mean zero. Under some additional tail conditions, we show that the spectral norm of $T_n$ is of the order $\sqrt{n \log n}$. The same result holds for random Hankel matrices as well as other variants of random Toeplitz matrices which have been studied in the literature.
The four major asymptotic level density laws of random matrix theory may all be showcased though their Jacobi parameter representation as having a bordered Toeplitz form. We compare and contrast these laws, completing and exploring their representations in one place. Inspired by the bordered Toeplitz form, we propose an algorithm for the finite moment problem by proposing a solution whose density has a bordered Toeplitz form.
We present some results concerning the almost sure behaviour of the operator norm or random Toeplitz matrices, including the law of large numbers for the norm, normalized by its expectation (in the i.i.d. case). As tools we present some concentration inequalities for suprema of empirical processes, which are refinements of recent results by Einmahl and Li.
We show that the top eigenvalue of an $n\times n$ random symmetric Toeplitz matrix, scaled by $\sqrt{2n\log n}$, converges to the square of the $2\to4$ operator norm of the sine kernel.
We show that the limiting eigenvalue distribution of random symmetric Toeplitz matrices is absolutely continuous with density bounded by 8, partially answering a question of Bryc, Dembo and Jiang (2006). The main tool used in the proof is a spectral averaging technique from the theory of random Schrödinger operators. The similar question for Hankel matrices remains open.
In this work, we consider symmetric random Toeplitz matrices $T_n$ generated by i.i.d. zero mean random variables ${X_k}$ satisfying the moment conditions: $E|X_k|^2=1$ and $\E|X_1|^n \le n^{\sqrt{n}}$ for all $n\ge 3$. We prove that the largest eigenvalue of $T_n$ scaled by $\sqrt{n log(n)}$ converges almost surely to $1$.
We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix $\mathcal{M}_N=M_N+N^{-γ}G_N$, where $γ>1/2$. With $L_N$ the empirical measure of eigenvalues of $\mathcal{M}_N$, we provide a general deterministic equivalence theorem that ties $L_N$ to the singular values of $z-M_N$, with $z\in \mathbb{C}$. We then compute the limit of $L_N$ when $M_N$ is an upper triangular Toeplitz matrix of finite symbol: if $M_N=\sum_{i=0…
Except the Toeplitz and Hankel matrices, the common patterned matrices for which the limiting spectral distribution (LSD) are known to exist, share a common property--the number of times each random variable appears in the matrix is (more or less) same across the variables. Thus it seems natural to ask what happens to the spectrum of the Toeplitz and Hankel matrices when each entry is scaled by the square root of the number of times that entry appears in the matrix instead of the uniform scaling by $n^{-1/2}$. We show that the LSD of these balanced matrices exist and derive integral formulae f…
We study the spectra of general $N\times N$ Toeplitz matrices given by symbols in the Wiener Algebra perturbed by small complex Gaussian random matrices, in the regime $N\gg 1$. We prove an asymptotic formula for the number of eigenvalues of the perturbed matrix in smooth domains. We show that these eigenvalues follow a Weyl law with probability sub-exponentially close to $1$, as $N\gg1$, in particular that most eigenvalues of the perturbed Toeplitz matrix are close to the curve in the complex plane given by the symbol of the unperturbed Toeplitz matrix.
The inverse problem of fractional Brownian motion and other Gaussian processes with stationary increments involves inverting an infinite hermitian positively definite Toeplitz matrix (a matrix that has equal elements along its diagonals). The problem of inverting Toeplitz matrices is interesting on its own and has various applications in physics, signal processing, statistics, etc. A large body of literature has emerged to study this question since the seminal work of Szegö on Toeplitz forms in 1920's. In this paper we obtain, for the first time, an explicit general formula for the inverse of …
We study the spectra of $N\times N$ Toeplitz band matrices perturbed by small complex Gaussian random matrices, in the regime $N\gg 1$. We prove a probabilistic Weyl law, which provides an precise asymptotic formula for the number of eigenvalues in certain domains, which may depend on $N$, with probability sub-exponentially (in $N$) close to $1$. We show that most eigenvalues of the perturbed Toeplitz matrix are at a distance of at most $\mathcal{O}(N^{-1+\varepsilon})$, for all $\varepsilon >0$, to the curve in the complex plane given by the symbol of the unperturbed Toeplitz matrix.
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 …
The purpose of this article is to study the eigenvalues $u_1^{\, t}=e^{itθ_1},\dots,u_N^{\,t}=e^{itθ_N}$ of $U^t$ where $U$ is a large $N\times N$ random unitary matrix and $t>0$. In particular we are interested in the typical times $t$ for which all the eigenvalues are simultaneously close to $1$ in different ways thus corresponding to recurrence times in the issue of quantum measurements. Our strategy consists in rewriting the problem as a random matrix integral and use loop equations techniques to compute the first orders of the large $N$ asymptotic. We also connect the problem to the compu…
