The smallest singular value of large random rectangular Toeplitz and circulant matrices

Abstract

Let xi, i∈Z be a sequence of i.i.d. standard normal random variables. Consider rectangular Toeplitz X=(xj-i)1≤ i≤ p,1≤ j≤ n and circulant X=(x(j-i) n)1≤ i≤ p,1≤ j≤ n matrices. Let p,n→∞ so that p/n→ c∈(0,1]. We prove that the smallest eigenvalue of 1nXX converges to zero in probability and in expectation. We establish a lower bound on the rate of this convergence. The lower bound is faster than any poly-log but slower than any polynomial rate. For the ``rectangular circulant'' matrices, we also establish a polynomial upper bound on the convergence rate, which is a simple explicit function of c.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…