Circular law for non-Hermitian block band matrices with slowly growing bandwidth
Abstract
We consider the empirical eigenvalue distribution for a class of non-Hermitian random block tridiagonal matrices T with independent entries. The matrix has n blocks on the diagonal and each block has size n, so the whole matrix has size nn. We assume that the nonzero entries are i.i.d. with mean 0, variance 1 and having sufficiently high moments. We prove that when the entries have a bounded density, then whenever n∞n=∞ and n=O(Poly(n)), the normalized empirical spectral distribution of T converges almost surely to the circular law. The growing bandwidth condition n∞n=∞ is the optimal condition of circular law with small bandwidth. This confirms the folklore conjecture that the circular law holds whenever the bandwidth increases with the dimension, while all existing results for the circular law are only proven in the delocalized regime n n.
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.