Spectral norm of random Toeplitz matrices
Malika Kharouf

TL;DR
This paper proves that the largest eigenvalue of symmetric random Toeplitz matrices, scaled by , converges almost surely to 1, revealing spectral norm behavior under specific moment conditions.
Contribution
The paper establishes the almost sure convergence of the scaled spectral norm of symmetric random Toeplitz matrices under new moment conditions.
Findings
Largest eigenvalue scaled by converges to 1 almost surely.
Spectral norm growth rate is characterized as log(n).
Results hold under specific moment conditions on the entries.
Abstract
In this work, we consider symmetric random Toeplitz matrices generated by i.i.d. zero mean random variables satisfying the moment conditions: and for all . We prove that the largest eigenvalue of scaled by converges almost surely to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Advanced Algebra and Geometry · Advanced Combinatorial Mathematics
